# Meeting place can not be changed

Easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

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

## Input

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

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

## Examples

Input #1

Answer #1

Submissions 1K

Acceptance rate 10%