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

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = m - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  //cout<<fixed<<setprecision(10);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>l(n),r(n);
  rep(i,0,n)cin>>l[i]>>r[i];
  vector<P>p(n);
  ll minr=INF,mindex=-1,minl=INF;
  rep(i,0,n){
    p[i]=MP(l[i],i);
    if(minr>r[i]){
      minr=r[i];
      minl=l[i];
      mindex=i;
    }
    else if(minr==r[i]&&minl>l[i]){
      minl=l[i];
      mindex=i;
    }
  }
  p.erase(p.begin()+mindex); 
  sort(ALL(p));
  multiset<ll,greater<ll>>stl;
  multiset<ll>str;
  rep(i,0,n){
    if(i==mindex)continue;
    stl.insert(l[i]);
    str.insert(r[i]);
  }
  ll maxl=l[mindex];
  ll idx=0;
  ll maxlen=0;
  while(!stl.empty()){
    //cout<<minr spa maxl spa *str.begin() spa *stl.begin()<<endl;
    chmax(res,max(0LL,minr-maxl+1)+max(0LL,*str.begin()-*stl.begin()+1));
    chmax(maxl,p[idx].fi);
    while(idx<n-1&&maxl>=p[idx].fi){
      chmax(maxlen,r[p[idx].se]-p[idx].fi+1);
      stl.erase(stl.find(p[idx].fi));
      str.erase(str.find(r[p[idx].se]));
      idx++;
    }
    //cout<<idx<<endl;
    if(idx==n-1){
      //cout<<maxl spa minr spa maxlen<<endl;
      chmax(res,max(0LL,minr-maxl+1)+maxlen);
      break;
    }
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 12800