#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#include<bitset>
#include<complex>
#include<chrono>
#include<random>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

ll gcd(ll n, ll m) {
	ll tmp;
	while (m!=0) {
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m) {
	return abs(n * m) / gcd(n, m);//gl=xy
}
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 
using namespace std;
//ここから

void solve(){
  int n;
  cin>>n;
  vector<ll>a(2*n);
  rep(i,2*n)cin>>a[i];
  vector<ll>sub(n);
  rep(i,n){
    sub[i]=-a[2*i+1]+a[2*i];
  }
  rep(i,n-1)sub[i+1]+=sub[i];
 // rep(i,n)cout<<sub[i]<<endl;
  vector<ll>rsub(n);
  rep(i,n)rsub[n-1-i]=a[2*n-1-2*i]-a[2*n-2-2*i];
  for(int i=n-1;i>0;--i)rsub[i-1]+=rsub[i];
  //rep(i,n)cout<<rsub[i]<<endl;
  ll ans=0;
  rep(i,n-1){
    chmax(ans,sub[i]+rsub[i+1]);
    chmax(ans,sub[n-1]);
    chmax(ans,rsub[0]);
  }
  cout<<ans<<endl;
}

int main(){
	ios::sync_with_stdio(false);
  cin.tie(0);
	cout<<fixed<<setprecision(15);
  solve();
	return 0;
}