#include<iostream>

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 typedef long long ll;

 int n;

 struct node

 {

     ll x,y;

     int id;

 }p[];

 ll sumx[],sumy[];

 ll numx[],numy[];

 bool cmp1(node a, node b)

 {

     return a.x < b.x;

 }

 bool cmp2(node a, node b)

 {

     return a.y < b.y;

 }

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--)

     {

         scanf("%d",&n);

         for(int i=;i<=n;i++)

         {

             scanf("%lld%lld",&p[i].x,&p[i].y);

             p[i].id = i;

         }

         sumx[] = sumy[] = ;

         sort(p+,p+n+,cmp1);

         for(int i=;i<=n;i++)  sumx[i] = sumx[i-] + p[i].x;

         for(int i=;i<=n;i++)  numx[p[i].id] = ((i-)*p[i].x-sumx[i-] + (sumx[n]-sumx[i]) - (n-i)*p[i].x);

         sort(p+,p+n+,cmp2);

         for(int i=;i<=n;i++)  sumy[i] = sumy[i-] + p[i].y;

         for(int i=;i<=n;i++)  numy[p[i].id] = ((i-)*p[i].y-sumy[i-] + (sumy[n]-sumy[i]) - (n-i)*p[i].y);

         ll ans = numx[] + numy[];

         for(int i=;i<=n;i++)

             ans=min(ans,numx[i]+numy[i]);

         printf("%lld\n",ans);

     }

     return ;

 }