#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin("heavymetal.in");
ofstream cout("heavymetal.out");

pair<int,int>v[100005];
long long n,d[100005];

int caut(int x){
    int st=1,dr=n,sol=0;
    while(st<=dr){
        int mj=(st+dr)/2;
        if(v[mj].first>=x)
            dr=mj-1;
        else{
            st=mj+1;
            sol=mj;
        }
    }
    return sol;
}

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>v[i].second>>v[i].first;
    }
    sort(v+1,v+n+1);
    for(int i=1;i<=n;i++){
        d[i]=max(v[i].first-v[i].second+1+caut(v[i].second),d[i-1]);
    }
    cout<<d[n];
    return 0;

}