#include<bits/stdc++.h>

#define ll long long

#define rep(i,a,b) for(int i=a;i<=b;i++)

using namespace std;

const int maxn=;

int x[maxn],y[maxn];ll sum[maxn],ans;

ll sumx[maxn],sumy[maxn];

struct point{ int x,y;}s[maxn];

bool cmpx(point w,point v){ return w.x<v.x; }

bool cmpy(point w,point v){ return w.y<v.y; }

int main()

{

    int N;

    scanf("%d",&N);

    rep(i,,N){

        ll tx,ty;

        scanf("%d%d",&tx,&ty);

        s[i].x=tx+ty; s[i].y=tx-ty;

    }

    sort(s+,s+N+,cmpx);

    rep(i,,N) x[i]=s[i].x,sumx[i]=sumx[i-]+s[i].x;

    sort(s+,s+N+,cmpy);

    rep(i,,N) y[i]=s[i].y, sumy[i]=sumy[i-]+s[i].y;

    rep(i,,N) {

        ll tmp=; int pos;

        pos=lower_bound(x+,x+N+,s[i].x)-x;

        tmp+=1LL*(pos-)*s[i].x-sumx[pos-]+(sumx[N]-sumx[pos-])-1LL*(N-pos+)*s[i].x;

        pos=lower_bound(y+,y+N+,s[i].y)-y;

        tmp+=1LL*(pos-)*s[i].y-sumy[pos-]+(sumy[N]-sumy[pos-])-1LL*(N-pos+)*s[i].y;

        if(i==) ans=tmp;

        else ans=min(ans,tmp);

    }

    cout<<ans/<<endl;

    return ;

}