1184_C1. 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.

Input

The first line contains an integer n (2 ≤ n ≤ 10).

Each of the following 4n + 1 lines contains two integers x_i, y_i (0 ≤ x_i, y_i ≤ 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.

Output

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

Examples

Input


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

Note

In both examples, the square has four sides x=0, x=2, y=0, y=2.
```python
import bisect
import functools
import math
import sys
from collections import defaultdict

# input = sys.stdin.readline
rt = lambda: map(int, input().split())
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))


def solve(pts):
    for x1 in range(50):
        for x2 in range(x1+1, 51):
            for y1 in range(50):
                for y2 in range(y1+1, 51):
                    wrong = []
                    for i in range(len(pts)):
                        x, y = pts[i]
                        if (x in (x1, x2) and y1 <= y <= y2) or (y in (y1, y2) and x1 <= x <= x2):
                            pass
                        else:
                            wrong.append(i)
                    if len(wrong) == 1:
                        return pts[wrong[0]]

def main():
    n = ri()
    pts = []
    for _ in range(4*n+1):
        pts.append(tuple(map(int, input().split())))

    print(*solve(pts))


if __name__ == '__main__':
    main()

```