#include <bits/stdc++.h>
#include <algorithm>
#include <cctype>
#include <climits>
#include <functional>
#include <iomanip>
#include <queue>
#include <set>
#include <valarray>
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define per(a, b, c) for (int a = c; a >= b; a--)
#define all(a) a.begin() + 1, a.end()
#define all_(a) a.begin(), a.end()
#define vi vector<int>
#define vl vector<ll>
#define vpii vector<pii>
#define vpll vector<pll>
int mod = 998244353;
ll gcd(ll a, ll b) {return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll fp_m (ll a, ll n) {
    a %= mod;
    ll res = 1; while (n) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res;
}
ll fp (ll a, ll n) {
    ll res = 1; while (n) { if (n & 1) res *= a; a *= a; n >>= 1; } return res;
}
ll inv(ll x) {return fp_m(x, mod - 2);}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {
    os << "[";
    for (size_t i = 0; i < vec.size(); ++i) {
        os << vec[i];
        if (i < vec.size() - 1)
            os << ", ";
    }
    os << "]";
    return os;
}
template<typename T, typename... Args>
void debug(std::string name, T value, Args &&...arg) {
    std::cout << name;
    (..., (std::cout << '[' << arg << ']'));
    std::cout << " = " << value << '\n';
}
//中文测试 中文测试
signed main()   {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0); std::cout.tie(0);
    int tt; std::cin >> tt;
    while (tt--) {
        int n; std::cin >> n;
        int X, Y, XY, YX;
        std::vector<long long> x(n + 1), y(n + 1);
        for (int i = 1; i <= n; i++) {
            std::cin >> x[i] >> y[i];
        }
        if (n == 1) {
            std::cout << "YES" << '\n';
            std::cout << x[1] << ' ' << y[1] << '\n';
            return 0;
        }
        bool flag = 1;
        for (int i = 2; i <= n; i++) {
            if (x[i] == X || y[i] == Y || x[i] - y[i] == XY || YX == x[i] + y[i]) {
                continue;
            } else {
                flag = 0;
                // four edges : 
                // 1.
                // 2. 
                // Y = X + (y - x)
                // Y = -X + (x + y)
                // Y = X + (y - x)

                // Y = X + (y - x)
                // Y = -X + (x + y)

                // X + (y - x) = -X + (x2 + y2)
                // X = (x2 + x + y2 - y) / 2;
                // Y = X + (y - x)
                std::vector<std::pair<int, int>> points = {{x[i], y[1]}, {x[1], y[i]}, {x[i], x[i] + (y[1] - x[1])}, {y[i] - y[1] + x[1], y[i]},
                {x[i], -x[i] + (x[1] + y[1])}, {-y[i] + (x[1] + y[1]), y[i]}, {x[1], x[1] + (y[i] - x[i])}, {y[1] - y[i] + x[i], y[1]},
                {x[1], -x[1] + (x[i] + y[i])}, {-y[1] + (x[i] + y[i]), y[1]}, {(x[i] - y[i] + x[1] + y[1]) / 2, (x[i] - y[i] + x[1] + y[1]) / 2 + (y[i] - x[i])}, {(x[1] - y[1] + x[i] + y[i]) / 2, (x[1] - y[1] + x[i] + y[i]) / 2}};
                for (auto [xx, yy] : points) {
                    bool fl = 1;
                    for (int j = 1; j <= n; j++) {
                        if (xx != x[j] && yy != y[j] && abs(xx - x[j]) != abs(yy - y[j])) {
                            fl = 0;
                            break;
                        }
                    }
                    if (fl == 1) {
                        std::cout << "YES" << '\n';
                        std::cout << xx << ' ' << yy << '\n';
                        return 0;
                    }
                }
            }
        }
        if (flag == 0) 
            std::cout << "NO" << '\n';
        else {
            std::cout << "YES" << '\n';
            std::cout << x[1] << ' ' << y[1] << '\n';
        }
    }
    return 0;
}


/*
1 2 3 4 5 6
[1, 1]
[2, 2]
[3, 3]
[4, 2]
[5, 1]
[6, 1]

*/