#include <bits/stdc++.h>
using namespace std;
 
long long minCost(vector<int>& a) {
    int n = a.size();
    sort(a.begin(), a.end());
    int med = a[n / 2];
    long long res = 0;
    for (int x : a) res += llabs(1LL * x - med);
    return res;
}
 
long long countWays(vector<int>& a) {
    int n = a.size();
    sort(a.begin(), a.end());
    if (n % 2 == 1) return 1;
    return (long long)(a[n / 2] - a[n / 2 - 1] + 1);
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T; cin >> T;
    while (T--) {
        int N; cin >> N;
        vector<int> X(N), Y(N);
        for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];
        long long S = minCost(X) + minCost(Y);
        long long K = countWays(X) * countWays(Y);
        cout << S << " " << K << "\n";
    }
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpsb25nIGxvbmcgbWluQ29zdCh2ZWN0b3I8aW50PiYgYSkgewogICAgaW50IG4gPSBhLnNpemUoKTsKICAgIHNvcnQoYS5iZWdpbigpLCBhLmVuZCgpKTsKICAgIGludCBtZWQgPSBhW24gLyAyXTsKICAgIGxvbmcgbG9uZyByZXMgPSAwOwogICAgZm9yIChpbnQgeCA6IGEpIHJlcyArPSBsbGFicygxTEwgKiB4IC0gbWVkKTsKICAgIHJldHVybiByZXM7Cn0KCmxvbmcgbG9uZyBjb3VudFdheXModmVjdG9yPGludD4mIGEpIHsKICAgIGludCBuID0gYS5zaXplKCk7CiAgICBzb3J0KGEuYmVnaW4oKSwgYS5lbmQoKSk7CiAgICBpZiAobiAlIDIgPT0gMSkgcmV0dXJuIDE7CiAgICByZXR1cm4gKGxvbmcgbG9uZykoYVtuIC8gMl0gLSBhW24gLyAyIC0gMV0gKyAxKTsKfQoKaW50IG1haW4oKSB7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwogICAgaW50IFQ7IGNpbiA+PiBUOwogICAgd2hpbGUgKFQtLSkgewogICAgICAgIGludCBOOyBjaW4gPj4gTjsKICAgICAgICB2ZWN0b3I8aW50PiBYKE4pLCBZKE4pOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgaSsrKSBjaW4gPj4gWFtpXSA+PiBZW2ldOwogICAgICAgIGxvbmcgbG9uZyBTID0gbWluQ29zdChYKSArIG1pbkNvc3QoWSk7CiAgICAgICAgbG9uZyBsb25nIEsgPSBjb3VudFdheXMoWCkgKiBjb3VudFdheXMoWSk7CiAgICAgICAgY291dCA8PCBTIDw8ICIgIiA8PCBLIDw8ICJcbiI7CiAgICB9Cn0K

MQoyCjAgMQoxIDAK

1
2
0 1
1 0