#include <cstdio>
#include <algorithm>

using namespace std;

const int INF=2000000001;

struct punct
{
    int x,y;
};

int cmp(punct a,punct b)
{
    return a.x<b.x;
}

punct v[210];
int d[210][210][4];

int main()
{
    freopen("wanted.in","r",stdin);
    freopen("wanted.out","w",stdout);
    int n,j1,a,b,r;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d%d",&v[i].x,&v[i].y);
    sort(v+1,v+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        if(i-1>0) d[i][i][0]=v[i].x-v[i-1].x+v[i].y+v[i-1].y;
        if(i+1<=n) d[i][i][1]=v[i].y+v[i+1].y+v[i+1].x-v[i].x;
    }
        for(int j=1;j<n;j++)
            for(int i=1;i<=n;i++)
            {
                j1=i+j;
                if(j1<=n)
                {
                    d[i][j1][0]=d[i][j1][1]=INF;
                    for(int k=i;k<=j1;k++)
                    {
                        a=v[i-1].y+v[k].y+v[k].x-v[i-1].x;
                        b=v[j1+1].y+v[k].y+v[j1+1].x-v[k].x;
                        d[i][j1][0]=min(d[i][j1][0],max(d[k+1][j1][0],d[i][k-1][1])+a);
                        d[i][j1][1]=min(d[i][j1][1],max(d[k+1][j1][0],d[i][k-1][1])+b);
                    }
                }
            }
        r=INF;
        for(int i=1;i<=n;i++)
        {
            a=abs(v[i].x)+v[i].y;
            r=min(r,max(d[i+1][n][0],d[1][i-1][1])+a);
        }
        printf("%d",r);
    return 0;
}