Problems
Meeting place can not be changed
Meeting place can not be changed
Given n points. Find two of them, the distance between which is minimal.
Input data
First line contains number of points n (2 ≤ n ≤ 10^5
). Each of the next n lines contains pair of integers x and y (-10^9
≤ x, y ≤ 10^9
) - the points coordinates. All points are different.
Output data
Print the coordinates of two selected points. The coordinates of each point should be printed on a separate line.
Examples
Input example #1
4 0 0 0 1 1 1 1 0
Output example #1
0 0 0 1