#include <bits/stdc++.h>
#define int long long
using namespace std;
int T, n;
int a[100010], b[100010];
vector<pair<int, int> >v;

signed main() {
	scanf("%lld", &T);
	while (T--) {
		scanf("%lld", &n);
		for (int i = 1; i <= n; i++) {
			scanf("%lld%lld", &a[i], &b[i]);
		}
		int x = a[1], y = b[1];
		int pos = 0;
		for (int i = 2; i <= n; i++) {
			if (x == a[i] || y == b[i])
				continue;
			int l1 = abs(x - a[i]), l2 = abs(y - b[i]);
			if (l1 == l2)
				continue;
			pos = i;
			break;
		}
		if (pos == 0) {
			printf("YES\n");
			printf("%lld %lld\n", x, y);
			continue;
		}
		//	cout << pos << endl;
		v.clear();
		v.push_back({x, b[pos]});
		v.push_back({a[pos], y});
		v.push_back({a[pos] + y - b[pos], y});
		v.push_back({a[pos] + b[pos] - y, y});
		v.push_back({x + y - b[pos], b[pos]});
		v.push_back({x + b[pos] - y, b[pos]});
		v.push_back({x, b[pos] + x - a[pos]});
		v.push_back({x, b[pos] + a[pos] - x});
		v.push_back({a[pos], y + a[pos] - x});
		v.push_back({a[pos], y + x - a[pos]});
		bool flag = 0;
		for (int i = 0; i < v.size(); i++) {

			int xx = v[i].first;
			int yy = v[i].second;
			//cout << xx << " " << yy << endl;
			bool fl = 1;
			for (int j = 2; j <= n; j++) {
				if (j == pos)
					continue;
				int xj = a[j], yj = b[j];
				if (xj == xx || yj == yy)
					continue;
				int x1 = abs(xx - xj), y1 = abs(yy - yj);
				if (x1 == y1)
					continue;
				fl = 0;
				break;
			}
			if (fl == 1) {
				flag = 1;
				printf("YES\n");
				printf("%lld %lld\n", xx, yy);
				break;
			}
		}
		if (flag == 0) {
			printf("NO\n");
		}
	}
}