#include <bits/stdc++.h>
#define size(a) (ll)(a).size()
#define int long long

using namespace std;
mt19937_64 urng_64(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937 urng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int INF = INT_MAX;
const ll INF_LL = LLONG_MAX;
const ld EPS = 1e-9;
const ll MOD = 1e9 + 7; //998244353;

struct point {
    int x;
    int y;
};

bool cmp1(const point p1, const point p2) {
    return p1.x < p2.x;
}

bool cmp2(const point p1, const point p2) {
    return p1.y < p2.y;
}

bool cmp3(const point p1, const point p2) {
    return p1.x - p1.y < p2.x - p2.y;
}

bool cmp4(const point p1, const point p2) {
    return p1.x + p1.y < p2.x + p2.y;
}

bool check(int x, int y, const vector<point> & v) {
    for (point p : v) {
        if (p.x != x and p.y != y and abs(p.x - x) != abs(p.y - y))
            return false;
    }
    return true;
}

void solve() {
    int n, curr1, curr2, curr_x, curr_y, t;
    cin >> n;
    vector <point> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i].x >> v[i].y;
    }

    // по X
    sort(v.begin(), v.end(), cmp1);
    curr1 = v[0].x;
    curr2 = v[n - 1].x;

    if (curr1 == curr2) {
        cout << "YES" << "\n";
        cout << v[0].x << " " << v[0].y << "\n";
        return;
    }

    else {
        curr_x = v[0].x;
        curr_y = v[n - 1].y;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = v[0].x;
        curr_y = v[0].x - (v[n - 1].x - v[n - 1].y);

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = v[0].x;
        curr_y = (v[n - 1].x + v[n - 1].y) - v[0].x;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

    }

    // по Y
    sort(v.begin(), v.end(), cmp2);
    curr1 = v[0].y;
    curr2 = v[n - 1].y;

    if (curr1 == curr2) {
        cout << "YES" << "\n";
        cout << v[0].x << " " << v[0].y << "\n";
        return;
    }

    else {
        curr_x = v[n - 1].x;
        curr_y = v[0].y;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = v[n - 1].x - v[n - 1].y + v[0].y;
        curr_y = v[0].y;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = v[n - 1].x + v[n - 1].y - v[0].y;
        curr_y = v[0].y;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

    }

    // по X - Y
    sort(v.begin(), v.end(), cmp3);
    curr1 = v[0].x - v[0].y;
    curr2 = v[n - 1].x - v[n - 1].y;


    if (curr1 == curr2) {
        cout << "YES" << "\n";
        cout << v[0].x << " " << v[0].y << "\n";
        return;
    }

    else {
        t = curr1;
        curr_x = v[n - 1].x;
        curr_y = v[n - 1].x - t;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = t + v[n - 1].y;
        curr_y = v[n - 1].y;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = (t + v[n - 1].x + v[n - 1].y) / 2;
        curr_y = (-t + v[n - 1].x + v[n - 1].y) / 2;

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

    }

    // по X + Y
    sort(v.begin(), v.end(), cmp4);
    curr1 = v[0].x + v[0].y;
    curr2 = v[n - 1].x + v[n - 1].y;


    if (curr1 == curr2) {
        cout << "YES" << "\n";
        cout << v[0].x << " " << v[0].y << "\n";
        return;
    }

    else {
        t = curr1;
        curr_x = v[n - 1].x;
        curr_y = t - v[n - 1].x;
        //cout << curr_x << " " << curr_y << "\n";

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = t - v[n - 1].y;
        curr_y = v[n - 1].y;
        //cout << curr_x << " " << curr_y << "\n";

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

        curr_x = (t + v[n - 1].x - v[n - 1].y) / 2;
        curr_y = (t - (v[n - 1].x - v[n - 1].y)) / 2;
        //cout << curr_x << " " << curr_y << "\n";

        if (check(curr_x, curr_y, v)) {
            cout << "YES" << "\n";
            cout << curr_x << " " << curr_y << "\n";
            return;
        }

    }
    cout << "NO" << "\n";
    return;

}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endif
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout.precision(20);

    int t;
    cin >> t;
    for (int i = 1; i <= t; ++i)
        solve();
}