#include <bits/stdc++.h>
#define FOR(i, n, m) for(ll i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 1000000007;
constexpr long double eps = 1e-15;

template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}

struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }

#define MAX_N 3030303
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}

using mi = modint;

mi mod_pow(ll a, ll n) {
    mi ret = 1;
    mi tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        tmp = tmp * tmp;
        n /= 2;
    }
    return ret;
}

ll calc(vector<P> v) {
    int n = (int)v.size();
    vector<P> mm1(n), mm2(n);
    mm1[0] = v[0];
    mm2[n - 1] = v[n - 1];
    FOR(i, 1, n) {
        mm1[i].first = max(mm1[i - 1].first, v[i].first);
        mm1[i].second = min(mm1[i - 1].second, v[i].second);
    }
    for(int i = n - 2; i >= 0; i--) {
        mm2[i].first = max(mm2[i + 1].first, v[i].first);
        mm2[i].second = min(mm2[i + 1].second, v[i].second);
    }
    ll ret = 0;
    if(n == 1) return v[0].second - v[0].first + 1;
    REP(i, n) {
        ll tmp = v[i].second - v[i].first + 1;
        P mm = {0, inf};
        if(i) {
            mm.first = max(mm.first, mm1[i - 1].first);
            mm.second = min(mm.second, mm1[i - 1].second);
        }
        if(i < n - 1) {
            mm.first = max(mm.first, mm2[i + 1].first);
            mm.second = min(mm.second, mm2[i + 1].second);
        }
        tmp += max(0LL, mm.second - mm.first + 1);
        ret = max(ret, tmp);
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<P> v(n);
    REP(i, n) {
        cin >> v[i].first >> v[i].second;
    }
    ll ans = calc(v);
    REP(i, n) v[i].second = -v[i].second;
    sort(ALL(v));
    REP(i, n) v[i].second = -v[i].second;
    vector<P> nv;
    ll mn = v[n - 1].second;
    nv.pb(v[n - 1]);
    for(int i = n - 2; i >= 0; i--) {
        if(v[i].second < mn) {
            mn = v[i].second;
            nv.pb(v[i]);
        }
    }
    sort(ALL(nv));
    int nn = (int)nv.size();
    ans = max(ans, calc(nv));
    REP(i, nn - 1) {
        ll tmp1 = nv[0].second - nv[i].first + 1;
        if(tmp1 <= 0) continue;
        ll tmp2 = nv[i + 1].second - nv[nn - 1].first + 1;
        if(tmp2 <= 0) continue;
        ans = max(ans, tmp1 + tmp2);
    }
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 31788