#include<stdio.h>
#include<stdlib.h>
#include<math.h>
struct in
{
int a,b;
}map[25];
int x[25],y[25];
int cmp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
int main()
{
int s;
scanf("%d",&s);
while(s--)
{
int n,i,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&map[i].a,&map[i].b);
x[i]=map[i].a;
y[i]=map[i].b;
}
qsort(x,n,sizeof(x[0]),cmp);
qsort(y,n,sizeof(y[0]),cmp);
for(i=0;i<n;i++)
{
if(map[i].a!=x[n/2]||map[i].b!=y[n/2])
sum+=abs(map[i].a-x[n/2])+abs(map[i].b-y[n/2]);
}
printf("%d\n",sum);
}
return 0;
}
#include<stdlib.h>
#include<math.h>
struct in
{
int a,b;
}map[25];
int x[25],y[25];
int cmp(const void *a,const void *b)
{
return *(int *)a-*(int *)b;
}
int main()
{
int s;
scanf("%d",&s);
while(s--)
{
int n,i,sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&map[i].a,&map[i].b);
x[i]=map[i].a;
y[i]=map[i].b;
}
qsort(x,n,sizeof(x[0]),cmp);
qsort(y,n,sizeof(y[0]),cmp);
for(i=0;i<n;i++)
{
if(map[i].a!=x[n/2]||map[i].b!=y[n/2])
sum+=abs(map[i].a-x[n/2])+abs(map[i].b-y[n/2]);
}
printf("%d\n",sum);
}
return 0;
}