#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
 
using namespace std;
 
const long long INF =  1LL<<63-1;
 
struct acmers{
    long long x;
    long long y;
    long long sum;
}a[100010];
 
bool cmp1(acmers a, acmers b){
    return a.x < b.x;
}
 
bool cmp2(acmers a, acmers b){
    return a.y < b.y;
}
 
int main(){
    long long t;
    long long i;
    long long n;
    long long rankx, ranky, rankxr, rankyd;
    long long sumxl, sumxr;
    long long sumyu, sumyd;
    scanf("%I64d", &t);
    while(t --){
        scanf("%I64d", &n);
        sumxr = 0;
        sumyd = 0;
        for(i = 0; i < n; i ++){
            scanf("%I64d %I64d", &a[i].x, &a[i].y);
            a[i].sum = 0;
            sumxr += a[i].x;
            sumyd += a[i].y;
        }
        //cout << "sumxr" << sumxr << endl;
        //cout << "sumyd" << sumyd << endl;
        sort(a, a+n, cmp1);
        sumxl = 0;
        rankx = 0;
        rankxr = n;
        for(rankx = 0; rankx < n; rankx ++){
            sumxr -= a[rankx].x;
            rankxr--;
            a[rankx].sum += rankx * a[rankx].x - sumxl + sumxr - rankxr * a[rankx].x;
            sumxl += a[rankx].x;
        }
        sort(a, a + n, cmp2);
        sumyu = 0;
        ranky = 0;
        rankyd = n;
        for(ranky = 0; ranky < n; ranky ++){
            sumyd -= a[ranky].y;
            rankyd--;
            a[ranky].sum += ranky * a[ranky].y - sumyu + sumyd - rankyd * a[ranky].y;
            sumyu += a[ranky].y;
        }
        long long mm = INF;
        for(i = 0; i < n; i ++){
            if (a[i].sum < mm)
                mm = a[i].sum;
        }
        cout << mm << endl;
    }
    return 0;
}