#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }

int main(){
    int N;
    cin >> N;
    pair<lint, lint> LR[N];
    lint ans = 0;
    for(int i = 0; i < N; i++){
        cin >> LR[i].first >> LR[i].second;
    }
    {
        pair<lint, lint> L_LR[N];
        pair<lint, lint> R_LR[N];
        L_LR[0] = LR[0];
        R_LR[N - 1] = LR[N - 1];
        for(int i = 0; i < N - 1; i++){
            L_LR[i + 1] = {max(L_LR[i].first, LR[i + 1].first), min(L_LR[i].second, LR[i + 1].second)};
            R_LR[N - i - 2] = {max(R_LR[N - i - 1].first, LR[N - i - 2].first), min(R_LR[N - i - 1].second, LR[N - i - 2].second)};
        }
        ans = max(ans, max(0ll, R_LR[1].second - R_LR[1].first + 1) + max(0ll, LR[0].second - LR[0].first + 1));
        ans = max(ans, max(0ll, L_LR[N - 2].second - L_LR[N - 2].first + 1) + max(0ll, LR[N - 1].second - LR[N - 1].first + 1));
        for(int i = 1; i < N - 1; i++){
            lint L_max = max(L_LR[i - 1].first, R_LR[i + 1].first);
            lint R_min = min(L_LR[i - 1].second, R_LR[i + 1].second);
            ans = max(ans, max(0ll, R_min - L_max + 1) + max(0ll, LR[i].second - LR[i].first + 1));
        }
    }
    for(int c = 0; c < 2; c++){
        sort(LR, LR + N);
        pair<lint, lint> L_LR[N];
        pair<lint, lint> R_LR[N];
        L_LR[0] = LR[0];
        R_LR[N - 1] = LR[N - 1];
        for(int i = 0; i < N - 1; i++){
            L_LR[i + 1] = {max(L_LR[i].first, LR[i + 1].first), min(L_LR[i].second, LR[i + 1].second)};
            R_LR[N - i - 2] = {max(R_LR[N - i - 1].first, LR[N - i - 2].first), min(R_LR[N - i - 1].second, LR[N - i - 2].second)};
        }/*
          for(int i = 0; i < N; i++){
          cout << L_LR[i].first << " " << L_LR[i].second << endl;
          }
          for(int i = 0; i < N; i++){
          cout << R_LR[i].first << " " << R_LR[i].second << endl;
          }*/
        for(int i = 0; i < N - 1; i++){
            ans = max(ans, max(0ll, L_LR[i].second - L_LR[i].first + 1) + max(0ll, R_LR[i + 1].second - R_LR[i + 1].first + 1));
        }
        for(int i = 0; i < N; i++){
            lint LR1 = LR[i].first;
            lint LR2 = LR[i].second;
            LR[i].first = 1e9 + 1 - LR2;
            LR[i].second = 1e9 + 1 - LR1;
        }
    }
    cout << ans << endl;
}



Measured memory_bytes: 4992