A farm is a convex polygon that contains points on a Cartesian plane. You want to hit a fence at a special point to break it. The special point is on the boundary of fence whose distance from you is minimum.
You are required to determine the special point.
Input format
Output format
Print two values denoting the and coordinates of the point that lies on the boundary and is nearest to you.
If there are multiple correct answers, then you can print any of them. Your answer can be considered correct if the distance of the special point from your position differs from the optimal distance by an absolute error of .
The point lies on the edge joining and . Thus it's the nearest point.