#include<algorithm>
using namespace std;

#define DIM 100001

int n,sol[DIM];

struct timp{
    int x,y;};
timp a[DIM];

int cmp(timp a,timp b){
    return a.x<b.x||(a.x==b.x&&a.y<b.y);}

int max(int a,int b){
    if(a>b)
        return a;
    return b;}

void solve(){
    int i,j,max0;
    
    scanf("%d",&n);
    for(i=1,max0=0; i<=n; max0=max(max0,a[i++].y))
        scanf("%d%d",&a[i].x,&a[i].y);
    sort(a+1,a+n+1,cmp);
    for(i=1; i<=max0; ++i){
        sol[i]=sol[i-1];
        for(j=1; j<=n; ++j)
            if(a[j].y==i)
                sol[i]=max(sol[i],sol[a[j].x]+a[j].y-a[j].x);}
    printf("%d",sol[max0]);}
    
int main(){
	freopen("heavymetal.in","r",stdin);
	freopen("heavymetal.out","w",stdout);
    solve();
    return 0;}