Chef has $N$ axis-parallel rectangles in a 2D Cartesian coordinate system. These rectangles may intersect, but it is guaranteed that all their $4N$ vertices are pairwise distinct.
Unfortunately, Chef lost one vertex, and up until now, none of his fixes have worked (although putting an image of a point on a milk carton might not have been the greatest idea after all…). Therefore, he gave you the task of finding it! You are given the remaining $4N-1$ points and you should find the missing one.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains a single integer $N$.
- Then, $4N-1$ lines follow. Each of these lines contains two space-separated integers $x$ and $y$ denoting a vertex $(x, y)$ of some rectangle.

-----Output-----
For each test case, print a single line containing two space-separated integers $X$ and $Y$ ― the coordinates of the missing point. It can be proved that the missing point can be determined uniquely.

-----Constraints-----
- $T \le 100$
- $1 \le N \le 2 \cdot 10^5$
- $|x|, |y| \le 10^9$
- the sum of $N$ over all test cases does not exceed $2 \cdot 10^5$

-----Subtasks-----
Subtask #1 (20 points):
- $T = 5$
- $N \le 20$
Subtask #2 (30 points): $|x|, |y| \le 10^5$
Subtask #3 (50 points): original constraints

-----Example Input-----
1
2
1 1
1 2
4 6
2 1
9 6
9 3
4 3

-----Example Output-----
2 2

-----Explanation-----
The original set of points are:

Upon adding the missing point $(2, 2)$, $N = 2$ rectangles can be formed:

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
for _ in range(int(input())):
	n = int(input())
	a = []
	b = []
	for i in range(4 * n - 1):
		(c, d) = list(map(int, input().split()))
		a.append(c)
		b.append(d)
	c1 = 0
	c2 = 0
	for i in a:
		c1 ^= i
	for i in b:
		c2 ^= i
	print(c1, c2)


for _ in range(int(input())):
	n = int(input())
	n = n * 4 - 1
	x = 0
	y = 0
	for z in range(n):
		(a, b) = list(map(int, input().split()))
		x ^= a
		y ^= b
	print(x, y)


test_case = int(input())
while test_case:
	n = int(input())
	xdict = {}
	ydict = {}
	total_points = 4 * n - 1
	for _ in range(total_points):
		(x, y) = map(int, input().split())
		if x not in xdict:
			xdict[x] = 1
		else:
			xdict[x] += 1
		if y not in ydict:
			ydict[y] = 1
		else:
			ydict[y] += 1
	for key in xdict.keys():
		if xdict[key] % 2 != 0:
			print(key, end=' ')
			break
	for key in ydict.keys():
		if ydict[key] % 2 != 0:
			print(key)
			break
	test_case -= 1


test_case = int(input())
while test_case:
	n = int(input())
	points = []
	total_points = 4 * n - 1
	for _ in range(total_points):
		points.append(list(map(int, input().strip().split())))
	xor_x = 0
	xor_y = 0
	for p in points:
		xor_x ^= p[0]
		xor_y ^= p[1]
	print(xor_x, xor_y)
	test_case -= 1


for _ in range(int(input())):
	n = int(input())
	x = []
	y = []
	k = 4 * n - 1
	for i in range(k):
		(a, b) = input().split()
		x.append(a)
		y.append(b)
	x.sort()
	y.sort()
	l = y[k - 1]
	j = x[k - 1]
	for i in range(0, k - 1, 2):
		if x[i] != x[i + 1]:
			j = x[i]
			break
	for i in range(0, k - 1, 2):
		if y[i] != y[i + 1]:
			l = y[i]
			break
	print(j, l)


for _ in range(int(input())):
	n = int(input())
	x = []
	y = []
	k = 4 * n - 1
	for i in range(k):
		(a, b) = input().split()
		if a in x:
			x.remove(a)
		else:
			x.append(a)
		if b in y:
			y.remove(b)
		else:
			y.append(b)
	print(x[0], y[0])


T = int(input())
for i in range(T):
	N = int(input())
	xcord = {}
	ycord = {}
	for i in range(4 * N - 1):
		(x, y) = list(map(int, input().split()))
		xcord[x] = xcord.get(x, 0) + 1
		ycord[y] = ycord.get(y, 0) + 1
	x = None
	y = None
	for i in xcord:
		if xcord[i] % 2 != 0:
			x = i
			break
	for i in ycord:
		if ycord[i] % 2 != 0:
			y = i
			break
	print(x, y)


t = int(input())
for _ in range(t):
	N = int(input())
	m = []
	n = []
	for _ in range(4 * N - 1):
		(x, y) = map(int, input().split())
		m.append(x)
		n.append(y)
	for i in m:
		if m.count(i) != 2:
			a = i
	for i in n:
		if n.count(i) != 2:
			b = i
	print(a, b)


t = int(input())
for i in range(t):
	n = int(input())
	coordinates_x = {}
	coordinates_y = {}
	for j in range(4 * n - 1):
		coord = input().split()
		x_axis = coordinates_x.get(int(coord[0]), [])
		x_axis.append(int(coord[1]))
		coordinates_x[int(coord[0])] = x_axis
		y_axis = coordinates_y.get(int(coord[1]), [])
		y_axis.append(int(coord[0]))
		coordinates_y[int(coord[1])] = y_axis
	for (k, v) in coordinates_x.items():
		if len(v) % 2 != 0:
			x_coord = k
	for (k, v) in coordinates_y.items():
		if len(v) % 2 != 0:
			y_coord = k
	print(x_coord, y_coord)


try:
	testcases = int(input())
	for i in range(testcases):
		rects = int(input())
		xCords = {}
		yCords = {}
		for i in range(rects * 4 - 1):
			(x, y) = list(map(int, input().split()))
			xCords[x] = xCords.get(x, 0) + 1
			yCords[y] = yCords.get(y, 0) + 1
		x = None
		y = None
		for i in xCords:
			if xCords[i] % 2 != 0:
				x = i
				break
		for i in yCords:
			if yCords[i] % 2 != 0:
				y = i
				break
		print(x, y)
except:
	pass


try:
	testcases = int(input())
	for i in range(testcases):
		rects = int(input())
		xCords = {}
		yCords = {}
		check = lambda x, hashMap: True if x in hashMap else False
		for i in range(rects * 4 - 1):
			(x, y) = list(map(int, input().split()))
			xCords[x] = xCords.get(x, 0) + 1
			yCords[y] = yCords.get(y, 0) + 1
		x = None
		y = None
		for ((i, j), (i1, j1)) in zip(xCords.items(), yCords.items()):
			if j % 2 != 0 and (not x):
				x = i
			if j1 % 2 != 0 and (not y):
				y = i1
			if x and y:
				break
		print(x, y)
except:
	pass


from collections import Counter
t = int(input())
for _ in range(t):
	n = int(input())
	x = Counter()
	y = Counter()
	for i in range(4 * n - 1):
		(a, b) = map(int, input().split())
		x.update([a])
		y.update([b])
	for i in x.keys():
		if x[i] % 2 != 0:
			p = i
			break
	for j in y.keys():
		if y[j] % 2 != 0:
			q = j
			break
	print(p, q)


t = int(input())
for _ in range(t):
	n = int(input())
	x = []
	y = []
	for i in range(4 * n - 1):
		(a, b) = list(map(int, input().split()))
		x.append(a)
		y.append(b)
	xs = set(x)
	ys = set(y)
	for i in xs:
		if x.count(i) % 2 != 0:
			p = i
			break
	for j in ys:
		if y.count(j) % 2 != 0:
			q = j
			break
	print(p, q)


from collections import defaultdict as dd
t = int(input())
for T in range(t):
	n = int(input())
	x = dd(int)
	y = dd(int)
	for i in range(4 * n - 1):
		(v1, v2) = [int(_) for _ in input().split()]
		x[v1] += 1
		y[v2] += 1
	(ansx, ansy) = (0, 0)
	for i in x:
		if x[i] % 2:
			ansx = i
			break
	for i in y:
		if y[i] % 2:
			ansy = i
			break
	print(ansx, ansy)


for tc in range(int(input())):
	N1 = int(input())
	P1 = set()
	Q1 = set()
	for i in range(4 * N1 - 1):
		(firt, sec1) = map(int, input().split())
		if firt in P1:
			P1.remove(firt)
		else:
			P1.add(firt)
		if sec1 in Q1:
			Q1.remove(sec1)
		else:
			Q1.add(sec1)
	print(*P1, *Q1)


t = int(input())
for _ in range(t):
	n = int(input())
	x_points = {}
	y_points = {}
	for i in range(4 * n - 1):
		(x, y) = map(int, input().split())
		x_points[x] = x_points.setdefault(x, 0) + 1
		y_points[y] = y_points.setdefault(y, 0) + 1
	for x in x_points:
		if x_points[x] % 2 == 1:
			print(x, end=' ')
	for y in y_points:
		if y_points[y] % 2 == 1:
			print(y, end=' ')