#include<bits/stdc++.h>
using namespace std;
#define int long long
#define cg (c=getchar())
inline int qread(){int x,f=1;char c;while(cg<'0'||'9'<c)if(c=='-')f=-1;for(x=(c^48);'0'<=cg&&c<='9';x=(x<<1)+(x<<3)+(c^48));return x*f;
}
#undef cg
template<class T>inline T Max(const T x,const T y){return x>y?x:y;}
template<class T>inline T Min(const T x,const T y){return x<y?x:y;}
template<class T>inline T fab(const T x){return x>0?x:-x;}
const int MAXN=3e5;
struct node{int x,y,c;node(){x=y=c=0;}node(const int X,const int Y):x(X),y(Y),c(Max(X,Y)){}node(const int X,const int Y,const int C):x(X),y(Y),c(C){}bool operator<(const node& a){if(c!=a.c)return c<a.c;if(x!=a.x)return x<a.x;return y<a.y;}
}dat[MAXN+5];
inline int dis(const int i,const int j){return fab(dat[i].x-dat[j].x)+fab(dat[i].y-dat[j].y);}
int hasind;
int dp[MAXN+5][2];
int l[MAXN+5],r[MAXN+5];
signed main(){int N=qread();for(int i=1,a,b;i<=N;++i){a=qread(),b=qread();dat[i]=node(a,b);}sort(dat+1,dat+N+1);l[hasind]=0;for(int i=1,pre=0;i<=N;++i){if(dat[i].c^pre){r[hasind]=i-1;pre=dat[i].c;l[++hasind]=i;}dat[i].c=hasind;}r[hasind]=N;for(int i=1;i<=hasind;++i){dp[i][0]=Min(dp[i-1][0]+dis(l[i-1],r[i]),dp[i-1][1]+dis(r[i-1],r[i]))+dis(r[i],l[i]);dp[i][1]=Min(dp[i-1][0]+dis(l[i-1],l[i]),dp[i-1][1]+dis(r[i-1],l[i]))+dis(l[i],r[i]);}printf("%lld\n",Min(dp[hasind][0]+dis(l[hasind],0),dp[hasind][1]+dis(r[hasind],0)));return 0;
}