当前没有测试数据。

题目描述

There are always some problems that seem simple but is difficult to solve.

ZYB got $\ N$ distinct points on a two-dimensional plane. He wants to draw a magic line so that the points will be divided into two parts, and the number of points in each part is the same. There is also a restriction: this line can not pass through any of the points.

Help him draw this magic line.

输入格式

There are multiple cases. The first line of the input contains a single integer $T \ (1 \leq T \leq 10000)$, indicating the number of cases.

For each case, the first line of the input contains a single even integer $N \ (2 \leq N \leq 1000)$, the number of points. The following $N$ lines each contains two integers $x_i, y_i \ (|x_i, y_i| \leq 1000)$, denoting the x-coordinate and the y-coordinate of the $\ i$-th point.

It is guaranteed that the sum of N\ N N over all cases does not exceed $2 \times 10^5$.

输出格式

For each case, print four integers $x_1, y_1, x_2, y_2$​ in a line, representing a line passing through $(x_1, y_1)$ and $(x_2, y_2)$. Obviously the output must satisfy $(x_1,y_1) \ne (x_2,y_2)$.

The absolute value of each coordinate must not exceed 10910^9109. It is guaranteed that at least one solution exists. If there are multiple solutions, print any of them.

样例

样例输入 1

1
4
0 1
-1 0
1 0
0 -1

样例输出 1

-1 999000000 1 -999000001