Meeting place can not be changed

Given $n$ points on a plane. Find two points such that the distance between them is minimal.

Input

The first line contains an integer $n(2\le n\le 10^5)$ — the number of points. Each of the following $n$ lines contains two integers $x$ and $y(-10^9\le x,y\le 10^9)$ — the coordinates of a point. It is guaranteed that all points are distinct.

Output

Print the coordinates of the two points with the minimal distance between them. Print the coordinates of each point on a separate line.

Examples