#include<bits/stdc++.h>

 #define pa pair<int,int>

 #define lowb(x) ((x)&(-(x)))

 #define REP(i,n0,n) for(i=n0;i<=n;i++)

 #define PER(i,n0,n) for(i=n;i>=n0;i--)

 #define MAX(a,b) ((a>b)?a:b)

 #define MIN(a,b) ((a<b)?a:b)

 #define CLR(a,x) memset(a,x,sizeof(a))

 #define rei register int

 using namespace std;

 typedef long long ll;

 const int maxn=2e5+;

 inline ll rd(){

     ll x=;char c=getchar();int neg=;

     while(c<''||c>''){if(c=='-') neg=-;c=getchar();}

     while(c>=''&&c<='') x=x*+c-'',c=getchar();

     return x*neg;

 }

 struct Node{

     int x,y,id;

 }pos[maxn];

 int N,xnxt[maxn][],ynxt[maxn][];

 int dis[maxn],px[maxn],py[maxn];

 bool flag[maxn];

 priority_queue<pa,vector<pa>,greater<pa> > q;

 inline bool cmp1(Node a,Node b){return a.x<b.x;}

 inline bool cmp2(Node a,Node b){return a.y<b.y;}

 inline void psh(int x,int d){

     if(dis[x]==-||d<dis[x]){

         dis[x]=d;

         if(!flag[x]) q.push(make_pair(d,x));

     }

 }

 inline void dijkstra(){

     memset(dis,-,sizeof(dis));dis[]=;

     q.push(make_pair(,));

     while(!q.empty()){

         int p=q.top().second;q.pop();if(flag[p]) continue;

         flag[p]=;

         if(p==N) return;

         if(xnxt[p][]) psh(xnxt[p][],dis[p]+px[p]-px[xnxt[p][]]);

         if(xnxt[p][]) psh(xnxt[p][],dis[p]-px[p]+px[xnxt[p][]]);

         if(ynxt[p][]) psh(ynxt[p][],dis[p]+py[p]-py[ynxt[p][]]);

         if(ynxt[p][]) psh(ynxt[p][],dis[p]-py[p]+py[ynxt[p][]]);

     }

 }

 int main(){

     //freopen(".in","r",stdin);

     rei i,j,k;

     N=rd();

     for(i=;i<=N;i++) px[i]=pos[i].x=rd(),py[i]=pos[i].y=rd(),pos[i].id=i;

     sort(pos+,pos+N+,cmp1);

     for(i=;i<=N;i++){

         xnxt[pos[i].id][]=pos[i-].id;

         xnxt[pos[i].id][]=pos[i+].id;

     }

     sort(pos+,pos+N+,cmp2);

     for(i=;i<=N;i++){

         ynxt[pos[i].id][]=pos[i-].id;

         ynxt[pos[i].id][]=pos[i+].id;

     }

     dijkstra();

     printf("%d\n",dis[N]);

     return ;

 }