C1. Heidi and the Turing Test (Easy)time limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!Heidi designed a series of increasingly difficult tasks for them to spend their time on, which would allow the Doctor enough time to save innocent lives!The funny part is that these tasks would be very easy for a human to solve.The first task is as follows. There are some points on the plane. All but one of them are on the boundary of an axis-aligned square (its sides are parallel to the axes). Identify that point.InputThe first line contains an integer n (2 \le n \le 10).Each of the following 4n + 1 lines contains two integers x_i, y_i (0 \leq x_i, y_i \leq 50), describing the coordinates of the next point.It is guaranteed that there are at least n points on each side of the square and all 4n + 1 points are distinct.OutputPrint two integers — the coordinates of the point that is not on the boundary of the square.ExamplesInput
2
0 0
0 1
0 2
1 0
1 1
1 2
2 0
2 1
2 2
Output
1 1
Input
2
0 0
0 1
0 2
0 3
1 0
1 2
2 0
2 1
2 2
Output
0 3
NoteIn both examples, the square has four sides x=0, x=2, y=0, y=2.
2
0 0
0 1
0 2
1 0
1 1
1 2
2 0
2 1
2 2

1 1 
['implementation', '*1600']