#pragma GCC optimize "Ofast"
#include <iostream>
#include <vector>
#include <tuple>
#include <set>
#include <algorithm>
#include <array>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;

struct Line {
	ll a, b;
	ll c;

	Line(ll x, ll y, ll sx, ll sy) {
		a = sx;
		b = sy;

		c = -a*x - b*y;
	}

	bool operator<(const Line &rhs) const {
		return tie(a, b, c) < tie(rhs.a, rhs.b, rhs.c);
	}
	
	bool operator==(const Line &rhs) const {
		return tie(a,b,c) == tie(rhs.a,rhs.b,rhs.c);
	}

	bool inter(ll px, ll py) {
		return px*a + py*b + c == 0;
	}

	bool inter(Line line, pii &pos) {
		ll ynum = a*line.c - c*line.a;
		ll ydenom = line.a*b - line.b*a;
		if (ydenom == 0 || ynum%abs(ydenom) != 0) {
			return false;
		}
		ll y = ynum/ydenom;

		ll xnum = b*line.c - c*line.b;
		ll xdenom = line.b*a - line.a*b;
		if (xdenom == 0 || xnum%abs(xdenom) != 0) {
			return false;
		}
		ll x = xnum/xdenom;
		pos = {x, y};
		return true;
	}

	pii getPoint() {
		// ax+by+c = 0
		if (b != 0) {
			return {0, -c/b};
		}
		else {
			return {-c/a, 0};
		}
	}
};

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t; cin >> t;
	while (t--) {
		vector<Line> lines;
		vector<pii> points;

		int n; cin >> n;
		pii a; cin >> a.first >> a.second;
		lines.push_back(Line( a.first, a.second, 0, 1 ));
		lines.push_back(Line( a.first, a.second, 1, 1 ));
		lines.push_back(Line( a.first, a.second, 1, 0 ));
		lines.push_back(Line( a.first, a.second, 1, -1 ));
		for (int i = 1; i < n; i++) {
			pii b; cin >> b.first >> b.second;
			vector<Line> cur;
			vector<pii> curPoints;
			for (Line x : { Line( b.first, b.second, 0, 1), Line(b.first, b.second, 1, 1), Line(b.first, b.second, 1, 0), Line(b.first, b.second, 1, -1) }) {
				bool found = false;
				for (int j = 0; j < lines.size(); j++) if (lines[j] == x) found = true;
				if (found) cur.push_back(x);
				for (Line y : lines) {
					pii pos;
					if (x.inter(y, pos)) {
						curPoints.push_back(pos);
					}
				}
				for (pii p : points) {
					if (x.inter(p.first, p.second)) curPoints.push_back(p);
				}
			}
			lines = cur;
			points = curPoints;
			sort(points.begin(), points.end());
			points.resize(unique(points.begin(), points.end()) - points.begin());
		}
		if (points.size() != 0) {
			cout << "YES" << '\n';
			auto [a, b] = *points.begin();
			cout << a << ' ' << b << '\n';
		}
		else if (lines.size() != 0) {
			Line l = *lines.begin();
			auto [a, b] = l.getPoint();
			cout << "YES" << '\n';
			cout << a << ' ' << b << '\n';
		}
		else {
			cout << "NO" << '\n';
		}
	}
}