Given points in 2D plane, where , no two points coincide and no three points are collinear. Find two intersecting lines satisfying that no given points lie in the two lines and that for each of the four divided areas, there are exactly given points. If multiple solution exist, print any one of them. If no solution, print ``-1'' in one line.

输入描述:

The first line contains one positive integer  (), denoting the number of test cases. For each test case:

The first line contains one integer , denoting the number of given points.

Following  lines each contains two integers , denoting one given point .

It is guaranteed that , that no two points coincide and that no three points are collinear.

输出描述:

For each test case:

If no solution, print ``-1'' in one line. Else print two lines each contains four integers  with absolute value not exceeding , denoting one line passing  simultaneously.

2
4
-1 -1
-1 1
1 -1
1 1
8
0 0
0 1
2 0
2 1
1 2
1 3
3 2
3 3

0 1 0 -1
1 0 -1 0
1 0 2 3
0 2 3 1