eolymp
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

First line contains number of points n (2n105). Each of the next n lines contains pair of integers x and y (-109x, y109) - the points coordinates. All points are different.

Output

Print the coordinates of two selected points. The coordinates of each point should be printed on a separate line.

Time limit 1 second
Memory limit 128 MiB
Input example #1
4
0 0
0 1
1 1
1 0
Output example #1
0 0
0 1