// Author: Olaf Surgut (surgutti)
// Created on 01-10-2024 14:06:24
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define endl '\n'
#define st first
#define nd second
#define pb push_bask
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, b, a) for (int i = (b); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)

#define int long long

struct Point {
	int x, y;

	Point operator- (Point other) const {
		return Point{x - other.x, y - other.y};
	}
};

int det(Point A, Point B) {
	return A.x * B.y - A.y * B.x;
}

Point dirs[4] = {Point{0, 1}, Point{1, 1}, Point{1, 0}, Point{1, -1}};

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int tt;
	cin >> tt;
	while (tt--) {
		int n;
		cin >> n;
		vector<Point> pts(n);
		for (auto& [x, y] : pts)
			cin >> x >> y;

		vector<map<int, int>> cnt(4);
		FOR(i, 1, n - 1) {
			Point P = pts[0], Q = pts[i];
			FOR(dir_P, 0, 3) FOR(dir_Q, 0, 3) {
				Point v = dirs[dir_P];
				Point w = dirs[dir_Q];
				
				if (det(v, w) == 0)
					continue;

				int p = det(Q - P, w);
				int q = det(v, w);

				if (abs(p) % abs(q) == 0) {
					cnt[dir_P][p / q]++;
				}
			}
		}
		
		bool ok = false;
		Point ans;

		const int inf = 1'000'000'000;

		auto test = [&](Point P) {
			if (abs(P.x) > inf || abs(P.y) > inf)
				return;

			for (auto [x, y] : pts) {
				if (x == P.x || y == P.y || abs(x - P.x) == abs(y - P.y))
					continue;
				return;
			}
			ok = true;
			ans = P;
		};

		FOR(dir, 0, 3) {
			int mx = 0;
			int id = -1;
			for (auto [a, b] : cnt[dir]) {
				if (mx < b) {
					mx = b;
					id = a;
				}
			}

			test(Point{pts[0].x + dirs[dir].x * id,
					   pts[0].y + dirs[dir].y * id});
		}

		if (ok)
			cout << "YES\n" << ans.x << ' ' << ans.y << '\n';
		else
			cout << "NO\n";
	}

	return 0;
}