#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<queue>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

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

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

    return x*f;

}

#define N 200010

int n,p[N],d[N],t=;

bool flag[N];

struct point{int x,y,i;

}a[N];

struct data{int to,nxt,len;

}edge[N<<];

struct data2

{

    int x,d;

    bool operator <(const data2&a) const

    {

        return d>a.d;

    }

};

priority_queue<data2> q;

void addedge(int x,int y,int z){t++;edge[t].to=y,edge[t].nxt=p[x],edge[t].len=z,p[x]=t;}

void dijkstra()

{

    while (!q.empty()) q.pop();

    for (int i=;i<=n;i++) d[i]=;q.push((data2){,});

    memset(flag,,sizeof(flag));

    for (int i=;i<=n;i++)

    {

        while (!q.empty()&&flag[q.top().x]) q.pop();

        if (q.empty()) break;

        data2 v=q.top();q.pop();

        flag[v.x]=;

        for (int j=p[v.x];j;j=edge[j].nxt)

        if (v.d+edge[j].len<d[edge[j].to])

        {

            d[edge[j].to]=v.d+edge[j].len;

            q.push((data2){edge[j].to,d[edge[j].to]});

        }

    }

}

bool cmp1(const point&a,const point&b)

{

    return a.x<b.x;

}

bool cmp2(const point&a,const point&b)

{

    return a.y<b.y;

}

int main()

{

#ifndef ONLINE_JUDGE

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

    freopen("bzoj4152.out","w",stdout);

    const char LL[]="%I64d\n";

#else

    const char LL[]="%lld\n";

#endif

    n=read();

    for (int i=;i<=n;i++) a[i].x=read(),a[i].y=read(),a[i].i=i;

    sort(a+,a+n+,cmp1);

    for (int i=;i<n;i++)

    addedge(a[i].i,a[i+].i,min(abs(a[i].x-a[i+].x),abs(a[i].y-a[i+].y))),

    addedge(a[i+].i,a[i].i,min(abs(a[i].x-a[i+].x),abs(a[i].y-a[i+].y)));

    sort(a+,a+n+,cmp2);

    for (int i=;i<n;i++)

    addedge(a[i].i,a[i+].i,min(abs(a[i].x-a[i+].x),abs(a[i].y-a[i+].y))),

    addedge(a[i+].i,a[i].i,min(abs(a[i].x-a[i+].x),abs(a[i].y-a[i+].y)));

    dijkstra();

    cout<<d[n];

    return ;

}