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

ZYB got  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 , indicating the number of cases. 

For each case, the first line of the input contains a single even integer , the number of points. The following $N$ lines each contains two integers , denoting the x-coordinate and the y-coordinate of the -th point.

It is guaranteed that the sum of  over all cases does not exceed .

输出描述:

For each case, print four integers  in a line, representing a line passing through  and . Obviously the output must satisfy .

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

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

-1 999000000 1 -999000001