Meeting place can not be changed

Input

The first line contains an integer $n$ ( $2 \leq n \leq 1 0^{5}$ 2 \le n \le 10^5) — the number of points. Each of the following $n$ lines contains two integers $x$ and $y$ ( $- 1 0^{9} \leq x, y \leq 1 0^{9}$ -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

Example 1

Loading