#include <algorithm>
using namespace std;
#include <stdio.h>
#define MAX 100001
struct smen{
    long x,y;
};
smen a[MAX];
long n;
void citire(){
 freopen("heavymetal.in","r",stdin);
 long i;
 scanf("%ld",&n);
 for(i=1;i<=n;i++)
     scanf("%ld %ld",&a[i].x,&a[i].y);
fclose(stdin);
}
long functie(smen a,smen b){
    return a.y<b.y;
}
int main(){
  citire();
  freopen("heavymetal.out","w",stdout);
  sort(a+1,a+n+1,functie);
  long i,B[MAX],j;
  // for(i=1;i<=n;i++)
   //  printf("%ld %ld\n",a[i].x,a[i].y);
    B[1]=a[1].y-a[1].x;
    for(i=2;i<=n;i++){
        j=i-1;
        while(a[j].y>a[i].x)j--;
        B[i]=B[i-1]>B[j]+a[i].y-a[i].x?B[i-1]:B[j]+a[i].y-a[i].x;
    }
    printf("%ld",B[n]);
    return 0;
}