//本题思路：取中位数，若是偶数，中间两个任取
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n,m,sum;
int x[21],y[21];
int i,j;
cin>>n;
while(n--)
{
sum=0;
cin>>m;
for(i=0; i<m; i++)
{
cin>>x[i]>>y[i];
}
//先排序,再取中位数
for(i=0; i<m; i++)
{
int f;
for(j=0; j<m; j++)
{
if(x[i] > x[j])
{
f = x[i];
x[i] = x[j];
x[j] = f;
}
if(y[i] > y[j])
{
f = y[i];
y[i] = y[j];
y[j] = f;
}
}
}
x[m] = x[m/2];
y[m] = y[m/2];
//计算
for(i=0; i<m; i++)
{
sum += (x[m]-x[i]>0?x[m]-x[i]:x[i]-x[m]);
sum += (y[m]-y[i]>0?y[m]-y[i]:y[i]-y[m]);
}
cout<<sum<<endl;
}
return 0;
}