#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}







int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        int n;
        cin >> n;
        vector<ll>p(n*2);
        for (int i = 0; i < n*2; i++)cin >> p[i];
        vector<ll>a(n+3),b(n+3);
        for (int i = 0; i < n*2; i+=2) {
            a[i/2+1] = p[i] - p[i + 1];
            b[i/2] = p[i + 1] - p[i];
            //cout << p[i]<<" "<<p[i+1];
        }
        for (int i = 0; i <= n ; i++) {
            a[i + 1] += a[i];
            //cout << a[i] << " ";
        }
        //cout << endl;

        for (int i = n; i >0; i--) {
            b[i - 1] += b[i];
            //cout << b[i] << " ";
        }
        //cout << b[0];
        //cout << endl;
        ll ans = -1e10;
        for (int i = 0; i <= n; i++) {

            ans = max(ans, a[i] + b[i]);
            //cout << a[i] << " " << b[i] << " " << ans << endl;
        }
        cout << ans;
    }
    return 0;
}