//#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
////////////////////////////

int main(){fastio
    
    ll n;cin>>n;
    ll a[2*n];rep(i,0,2*n-1)cin>>a[i];
    ll l[n+1],r[n+1];
    l[0]=0;
    rep(i,0,n-1){
        l[i+1]=l[i]+a[i*2]-a[i*2+1];
    }
    r[n]=0;
    for(ll i=n-1;i>=0;i--){
        r[i]=r[i+1]+a[i*2+1]-a[i*2];
    }
    //rep(i,0,n)cout<<l[i]<<" ";cout<<endl;
    //rep(i,0,n)cout<<r[i]<<" ";cout<<endl;
    ll ans=-inf;
    rep(i,0,n){
        Max(ans,l[i]+r[i]);
    }
    cout<<ans<<endl;
    
    return 0;
}