#include <bits/stdc++.h>
using namespace std;

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-7;
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(const auto &buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
#define INF INFINITY
bool feq(double x, double y) { return abs(x - y) <= eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

//========================================================================//

struct val_t {
	int id;
	ll l, r;
	Comp(val_t) {
		return l < another.l;
	}
};

int main() {
	quickio();
	int n; cin >> n;
	vector<val_t> vals(n);
	Loop(i, n) {
		vals[i].id = i;
		cin >> vals[i].l >> vals[i].r;
		vals[i].r++;
	}
	val_t top = { -1, LLONG_MAX, LLONG_MAX };
	val_t bot = { -1, LLONG_MIN, LLONG_MIN };
	Loop(i, n) {
		if (vals[i].r < top.r) {
			top = vals[i];
		}
		if (bot.l < vals[i].l) {
			bot = vals[i];
		}
	}
	ll ans = 0;
	Loop(i, n) {
		if (vals[i].id != top.id && vals[i].id != bot.id) {
			ans = max(ans, vals[i].r - vals[i].l);
		}
	}
	ans += max(0LL, top.r - bot.l);
	if (top.id != bot.id) {
		vector<val_t> a;
		Loop(i, n) {
			if (vals[i].l <= top.l) continue;
			if (bot.r <= vals[i].r) continue;
			a.push_back(vals[i]);
		}
		sort(a.begin(), a.end());
		int m = a.size();
		if (m > 0) {
			vll acc_top(m), acc_bot(m);
			Loop(i, m) {
				if (i == 0) acc_top[i] = a[i].l;
				else acc_top[i] = max(acc_top[i - 1], a[i].l);
			}
			Loopr(i, m) {
				if (i == m - 1) acc_bot[i] = a[i].r;
				else acc_bot[i] = min(acc_bot[i + 1], a[i].r);
			}
			ans = max(ans, (top.r - top.l) + max(0LL, acc_bot[0] - bot.l));
			ans = max(ans, (bot.r - bot.l) + max(0LL, top.r - acc_top[m - 1]));
			Loop(i, m - 1) {
				ans = max(ans, max(0LL, top.r - acc_top[i]) + max(0LL, acc_bot[i + 1] - bot.l));
			}
		}
		else {
			ans = max(ans, (top.r - top.l) + (bot.r - bot.l));
		}
	}
	cout << ans << endl;
}

Measured memory_bytes: 7028