#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
const int maxN = 100'005;
ll x[2][maxN];
void solve() {
    cin >> n;
    for (int i = 1; i <= 2 * n; i++) {
        cin >> x[0][i] >> x[1][i];
    }
    vector<ll> F[2];
    for (int it = 0; it < 2; it++) {
        vector<ll> X;
        for (int i = 1; i <= 2 * n; i++) {
            X.emplace_back(x[it][i]);
        }
        sort(X.begin(), X.end());
        vector<ll> cands;
        for (int i = 2; i <= 2 * n; i++) {
            cands.emplace_back(x[it][i] - x[it][1]);
            cands.emplace_back(-cands.back());
        }
        sort(cands.begin(), cands.end());
        cands.erase(unique(cands.begin(), cands.end()), cands.end());
        for (ll d : cands) {
//            cout << " CHECK " << d << " " << it << endl;
            bool ok = true;
            for (int u = 1; u <= 2 * n; u++) {
                int p = lower_bound(X.begin(), X.end(), x[it][u] + d) - X.begin();
                if (p < X.size() && X[p] == x[it][u] + d) continue;
                p = lower_bound(X.begin(), X.end(), x[it][u] - d) - X.begin();
                if (p < X.size() && X[p] == x[it][u] - d) continue;
                ok = false;
                break;
            }
            if (ok) {
//                cout << " ADD " << it << " " << d << endl;
                F[it].emplace_back(d);
            }
        }
    }
    assert(!F[0].empty());
    assert(!F[1].empty());
    vector<pair<ll,ll>> ans;
    for (ll ddx : F[0]) {
        for (ll ddy : F[1]) {
            ll dx = ddx;
            ll dy = ddy;
//            cout << dx << " " << dy << " HIHIHI " << endl;
            multiset<pair<ll,ll>> S;
            ll ini_x = dx, ini_y = dy;
            ll coef_x = 1;
            if (dx < 0) {
                coef_x *= -1;
                dx *= -1;
            }
            ll coef_y = 1;
            if (dy < 0) {
                coef_y *= -1;
                dy *= -1;
            }
            for (int i = 1; i <= 2 * n; i++) {
                S.insert({x[0][i] * coef_x, x[1][i] * coef_y});
            }
            bool good = true;
            while (!S.empty()) {
                auto it = *S.begin();
                S.erase(S.find(it));
                if (S.find({it.first + dx, it.second + dy}) == S.end()) {
                    good = false;
                    break;
                }
                S.erase(S.find({it.first + dx, it.second + dy}));
            }
            if (good)  {
                ans.emplace_back(ini_x, ini_y);
            }
        }
    }
    assert(!ans.empty());
    cout << ans.size() << '\n';
    for (auto& it : ans) {
        cout << it.first << " " << it.second << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}