#include <bits/stdc++.h>

using namespace std;

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

int n, best[100005], maxim;
struct intervalPuscarie // :)))
{
    int x, y;
}v[100005];

bool cmp(intervalPuscarie a, intervalPuscarie b)
{
    if (a.y == b.y)
        return a.x < b.x;
    return a.y < b.y;
}

int cautbin1(int i)
{
    int st = 1, dr = i - 1, sol = -1;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (v[mid].y <= v[i].x)
        {
            sol = mid;
            dr = mid - 1;
        }
        else
        {
            st = mid + 1;
        }
    }
    return sol;
}

int cautbin2(int i)
{
    int st = 1, dr = i - 1, sol = -2;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (v[mid].y <= v[i].x)
        {
            sol = mid;
            st = mid + 1;
        }
        else
        {
            dr = mid - 1;
        }
    }
    return sol;
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> v[i].x >> v[i].y;
    sort(v + 1, v + n + 1, cmp);
    for (int i = 1; i <= n; ++i)
    {
        best[i] = v[i].y - v[i].x;
    }
    for (int i = 2; i <= n; ++i)
    {
        int maxx = best[i];
        int a = cautbin1(i);
        int b = cautbin2(i);
        for (int j = a; j <= b; ++j)
            maxx = max(maxx, best[i] + best[j]);
        best[i] = maxx;
        maxim = max(maxim, best[i]);
    }
    fout << maxim;
    return 0;
}