시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 (추가 시간 없음) 256 MB111100.000%

## 문제

There are $n$ distinct points in the plane, any three of which are not colinear.

You are asked to use $\lceil \frac{n}{2} \rceil$ distinct lines passing through no given points to cut the plane into pieces such that no two points lie in the same piece.

## 입력

There are multiple test cases. The first line of the input contains an integer $T$, indicating the number of test cases. For each test case:

The first line contains an integer $n$ ($1\le n\le 100$) -- the number of points.

Each of the following $n$ lines contains two integers $x$ and $y$ ($-1000\le x,y \le 1000$) describing a point in the plane.

It is guaranteed that there always exists a solution for each test case and the sum of $n$ in all test cases does not exceed $10^5$.

## 출력

For each test case, output $\lceil \frac{n}{2} \rceil$ lines describing a solution.

Each line of them contains four integers $x_1$, $y_1$, $x_2$ and $y_2$ indicating a line through $(x_1,y_1)$ and $(x_2,y_2)$, where $(x_1,y_1) \neq (x_2,y_2)$ and the absolute value of the coordinates should not exceed $10^9$.

## 예제 입력 1

2
3
0 0
2 1
4 0
4
0 1
1 0
2 1
1 2


## 예제 출력 1

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