#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

struct point{
    int x,y;
    bool operator<(const point & r) const{
        return tie(x,y)<tie(r.x,r.y);
    }
};

long long n,sum;
point arr[100005];
int main(){
    scanf("%d", &n);
    for(int i = 0; i < n ;++i)scanf("%d%d",&arr[i].x,&arr[i].y);
    sort(arr, arr+n);
    for(int i = 1; i < n;++i){
        sum += abs(arr[i-1].x-arr[i].x)+abs(arr[i-1].y-arr[i].y);
    }
    printf("%d\n",sum);
    
    return 0;
}