#include <fstream>
#include <algorithm>
#define DIM 100001
#define INF 0x3f3f3f3f

using namespace std;

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

int N;
long long best[DIM], maxim;  // durata maxima ce se poate obtine pana la spectacolul i
struct show
{
   int start, end;
}s[DIM];

bool comp(const show &unu, const show &doi)
{
    if( unu.end == doi.end )
    {
        return unu.start < doi.start;
    }
    return unu.end < doi.end;
}

int main()
{
    int i, j;

    in >> N;
    for(i = 1; i <= N; i++)
    {
        in >> s[i].start >> s[i].end;
    }
    sort(s+1, s+N+1, comp);
    best[1] = s[1].end - s[1].start;
    maxim = -INF;
    for(i = 2; i <= N; i++)
    {
        for(j = i - 1; j && s[j].end > s[i].start; j--);
        {
            best[i] = s[i].end - s[i].start + best[j];
        }
        if( maxim < best[i] )
        {
            maxim = best[i];
        }
        best[i] = maxim;
    }
    out << maxim;
    return 0;
}