#include <stdio.h>

int n,i,j,Best[100000],b[100000],a[100000],maxim,x,y;
char ch[10];
int max(int a,int b)
{
    if (a>b)
    return a;
    else
    return b;
}

int main()
{
    freopen("heavymetal.in","rt",stdin);
    scanf("%d", &n);
    for (i=1;i<=n;++i)
          {
           gets(ch);
           x=y=j=0;
           while (ch[j]!=' ')
                  {
                        x=x*10+ch[j]-'0';
                        j++;
                        }
                        j++;
           while (ch[j])
           {
                y=y*10+ch[j]-'0';
                j++;
                }
            a[i]=x;
            b[i]=y;    
           maxim=max(maxim,b[i]);
        }
        
    for (i=1;i<=maxim;++i)
          {    
           Best[i]=Best[i-1];   
           for (j=1;j<=maxim;++j)
           if (b[j]==i)   
        Best[i]=max(Best[i],Best[a[j]]+(b[j]-a[j]));  
}

freopen("heavymetal.out","wt",stdout);
printf("%d", Best[maxim]);
return 0;
}