#include <iostream>
using namespace std;
int x[10000],y[10000];
int cmp(const void *a, const void *b)
{
return (*(int *)a - *(int *)b);
}
int main()
{
int i,n,xx,yy;
long dis=0;
cin>>n;
for(i=0;i<n;i++)
cin>>x[i]>>y[i];
qsort(x,n,sizeof(int),cmp);
qsort(y,n,sizeof(int),cmp);
for(i=0;i<n;i++)
{
xx=(x[i]-x[n/2])>=0?(x[i]-x[n/2]):(x[n/2]-x[i]);
yy=(y[i]-y[n/2])>=0?(y[i]-y[n/2]):(y[n/2]-y[i]);
dis+=xx+yy;
}
cout<<dis<<endl;
return 0;
}