CF1184C1.Heidi and the Turing Test (Easy)

The 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.

赛博人和戴立克长期以来一直是博士的主要敌人。众所周知，这两个种族都喜欢摧毁它们所遇到的一切。然而，关于它们的一个鲜为人知的事实是：它们也都热衷于参加图灵测试！

海蒂为它们设计了一系列难度逐级增加的任务，以便让它们耗费时间，从而为博士争取到足够的时间去拯救无辜的生命！

有趣的是，这些任务对人类而言却非常简单。

第一个任务如下：平面上有一些点，其中除一个点外，其余所有点都位于某个轴对齐正方形（即其边与坐标轴平行）的边界上。请找出那个不在边界上的点。

The 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.

第一行包含一个整数 $n$（$2 \le n \le 10$）。

接下来的 $4n + 1$ 行每行包含两个整数 $x_i, y_i$（$0 \leq x_i, y_i \leq 50$），描述下一个点的坐标。

保证正方形的每条边上至少有 $n$ 个点，且全部 $4n + 1$ 个点互不相同。

Print two integers — the coordinates of the point that is not on the boundary of the square.

输出两个整数——该点的坐标，该点不在正方形的边界上。

In both examples, the square has four sides $x=0$, $x=2$, $y=0$, $y=2$.

在两个例子中，正方形均有四条边：$x=0$、$x=2$、$y=0$、$y=2$。