#include <cstdio>
#include <algorithm>

using namespace std;

#define MAX_N 100005
#define DIM 8192

long N, logN;
long Bst[MAX_N];
char buf[DIM];
int pz;
struct met{long li, lf;} V[MAX_N];

void citire()
{
    scanf("%ld",&N);

    for(long i = 1; i <= N; ++i)
    {
        scanf("%ld %ld",&V[i].li, &V[i].lf);
    }
}

struct cmp
{
    bool operator()(const met a, const met b) const
    {
        return ((a.lf < b.lf) || (a.lf == b.lf) && (a.li < b.li));
    }
};

long b_search(long x)
{
    long i, lg;
    for(i = 0, lg = logN; lg; lg >>= 1)
        if(i + lg <= N && V[i + lg].lf <= x)
            i += lg;
    return i;
}

void solve()
{
    sort(V+1, V+N+1, cmp());

   for(logN = 1; logN <= N; logN <<= 1);

    for(int i = 1; i <= N; ++i)
    {
        Bst[i] = Bst[i-1];
        long poz = b_search(V[i].li);
        long dif = V[i].lf - V[i].li;
        if(Bst[poz] +  dif> Bst[i])
            Bst[i] =  dif + Bst[poz];
    }
    printf("%ld\n",Bst[N]);
}

int main()
{
    freopen("heavymetal.in","rt",stdin);
    freopen("heavymetal.out","wt",stdout);

    citire();
    solve();
}