#include <cstdio>
#include <algorithm>

using namespace std;

struct orase
{
    long long x,y;
    bool operator <(const orase &aux) const
    {
        return x<aux.x;
    }
}v[210];
long long d[210][210][2],n,i,j,q,sol=2000000000000;

long long dist(int i,int j)
{
    long long a=v[i].x-v[j].x;
    if(a<0) return -a;
    else return a;
}

int main()
{
    freopen("wanted.in", "r", stdin);
    freopen("wanted.out", "w", stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%lld%lld",&v[i].x,&v[i].y);
    sort(v+1,v+1+n);
    for(i=1;i<=n;i++)
    {
        d[i][i][0]=d[i][i][1]=0;
        d[i][i+1][0]=dist(i,i+1)+v[i+1].y;
        d[i][i+1][1]=dist(i,i+1)+v[i].y;
    }
    for(j=2;j<n;j++)
        for(i=1;i+j<=n;i++)
        {
            d[i][i+j][0]=dist(i,i+j)+2*v[i+j].y+d[i+1][i+j][1];
            d[i][i+j][1]=dist(i,i+j)+2*v[i].y+d[i][i+j-1][0];
            for(q=i+1;q<i+j;q++)
            {
                d[i][i+j][0]=min(d[i][i+j][0], dist(i,q)+2*v[q].y+max(d[i+1][q][1], d[q][i+j][0]));
                d[i][i+j][1]=min(d[i][i+j][1], dist(q,i+j)+2*v[q].y+max(d[i][q][1], d[q][i+j-1][0]));
            }
        }
    if(n==1) printf("%lld",v[1].y);
    else
    {
        for(i=1;i<=n;i++)
            sol=min(sol, dist(0,i)+2*v[i].y+max(d[1][i][1], d[i][n][0]));
        printf("%lld",sol);
    }
    return 0;
}