#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=100005;
map<int,int>cnt0,cnt1,cnt2,cnt3;
map<pa,int>Mp;
int ans,ax,ay;
int n,x[N],y[N];
void chk(int x,int y)
{
    if (ans) return;
    int t=0;
    if (cnt0.count(x)) t+=cnt0[x];
    if (cnt1.count(y)) t+=cnt1[y];
    if (cnt2.count(x-y)) t+=cnt2[x-y];
    if (cnt3.count(x+y)) t+=cnt3[x+y];
    if (Mp.count(mp(x,y))) t-=3;
    if (t==n) ans=1,ax=x,ay=y;
}
void BellaKira()
{
    cin>>n;
    for (int i=1;i<=n;i++)
        cin>>x[i]>>y[i],cnt0[x[i]]++,cnt1[y[i]]++,cnt2[x[i]-y[i]]++,cnt3[x[i]+y[i]]++,Mp[mp(x[i],y[i])]++;
    ans=0,ax=0,ay=0;
    for (int i=1;i<=n;i++)
        chk(x[i],y[i]);
    for (int i=2;i<=n;i++)
    {
        chk(x[1],y[i]);
        chk(x[i],y[1]);
        int d;
        d=abs(x[i]-x[1]);
        chk(x[1],y[i]+d);
        chk(x[1],y[i]-d);
        d=abs(y[i]-y[1]);
        chk(x[i]+d,y[1]);
        chk(x[i]-d,y[1]);
    }
    if (ans) cout<<"YES\n"<<ax<<" "<<ay<<'\n';
    else  cout<<"NO\n";
    cnt0.clear(),cnt1.clear(),cnt2.clear(),cnt3.clear();
    Mp.clear();
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    cin>>T;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/