#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

// #define Debug
// #define LOCAL
#define TestCases

const int N = 1e5;
const double Inf = 1e12;

/*
	0: x
	1: y
	2: x + y
	3: x - y
*/

struct Point
{
	double x, y;

	bool operator < (const Point &p) const
	{
		if (x != p.x)
			return x < p.x;
		return y < p.y;
	}
};
struct Line
{
	double A, B, C;
};

Point calculate(Line x, Line y)//with the help of numberempire
{
	if (x.B * y.A == x.A * y.B)
		return Point{Inf, Inf};//not exists

	double div = x.B * y.A - x.A * y.B;
	return Point{(x.C * y.B - x.B * y.C) / div, (x.A * y.C - x.C * y.A) / div};
}
Line turn(int type, double key)
{
	if (type == 0)
		return Line{1, 0, -key};
	if (type == 1)
		return Line{0, 1, -key};
	if (type == 2)
		return Line{1, 1, -key};
	return Line{1, -1, -key};
}
Line turn(int type, Point p)
{
	if (type == 0)
		return Line{1, 0, -p.x};
	if (type == 1)
		return Line{0, 1, -p.y};
	if (type == 2)
		return Line{1, 1, -p.x - p.y};
	return Line{1, -1, -p.x + p.y};
}
bool on(Line line, Point p)
{
	return p.x * line.A + p.y * line.B + line.C == 0;
}

int n;
Point p[N + 5];

map<double, int> cnt[4];
map<Point, int> box;

bool check(int type, double key)
{
	Line line = turn(type, key);//key must be integer

	#ifdef Debug
	cout << "check: ";
	cout << line.A << "x + " << line.B << "y + " << line.C << " = 0" << endl;
	#endif

	if (cnt[type][key] == n)
	{	
		puts("YES");

		Point res = calculate(line, Line{1, 0, 0});//x = 0
		if (type == 0)
			res = calculate(line, Line{0, 1, 0});
		printf("%d %d\n", (int)res.x, (int)res.y);

		return true;
	}

	box.clear();
	int need = n - cnt[type][key];

	#ifdef Debug
	cout << "need = " << need << endl;
	#endif

	for (int i = 1; i <= n; i++)
	{
		if (on(line, p[i]))
			continue;

		#ifdef Debug
		cout << i << ": ";
		printf("(%d, %d), not on line\n", (int)p[i].x, (int)p[i].y);
		#endif

		for (int t = 0; t < 4; t++)
		{
			Point res = calculate(turn(t, p[i]), line);

			#ifdef Debug
			cout << "type = " << t << ": ";
			printf("(%lf, %lf)\n", res.x, res.y);
			#endif
			
			if (res.x == Inf)//not exists
				continue;
			if ((double)((int)res.x) != res.x)//***.5, ***.5
				continue;

			box[res]++;

			if (box[res] == need)
			{
				puts("YES");
				printf("%d %d\n", (int)res.x, (int)res.y);
				return true;
			}
		}
	}
	return false;
}

void solve()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf("%lf%lf", &p[i].x, &p[i].y);
		cnt[0][p[i].x]++;
		cnt[1][p[i].y]++;
		cnt[2][p[i].x + p[i].y]++;
		cnt[3][p[i].x - p[i].y]++;
	}

	bool have = false;
	for (int t = 0; t < 4 && !have; t++)
	{
		for (auto pir : cnt[t])
		{
			if (pir.second * 4 < n)//key observation
				continue;

			if (check(t, pir.first))
			{
				have = 1;
				break;
			}
		}
	}

	if (!have)
		puts("NO");
	for (int t = 0; t < 4; t++)
		cnt[t].clear();
	return ;
}

int main()
{
	#ifdef LOCAL
	freopen("data.in", "r", stdin);
	freopen("mycode.out", "w", stdout);
	#endif
	
	int T = 1;
	
	#ifdef TestCases
	scanf("%d", &T);
	#endif

	while (T--)
		solve();
	return 0;
}