Given n points. Find two of them, the distance between which is minimal.

Input

First line contains number of points n (2 ≤ n ≤ 105). Each of the next n lines contains pair of integers x and y (-109 ≤ x, y ≤ 109) - 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.