#include<bits/stdc++.h>
using namespace std;
int n,x[10005],y[10005],ans;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
sort(x+1,x+n+1);
sort(y+1,y+n+1);
for(int i=1;i<=n;i++){
ans+=abs(y[i]-y[(n+1)/2]);
}
int minn=INT_MAX;
for(int i=x[1]-n;i<=x[1]+n;i++){
int sum=0;
for(int j=1;j<=n;j++){
sum+=abs(x[j]-(i+j-1));
}
minn=min(minn,sum);
}
cout<<ans+minn;
return 0;
}