#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;
void solve(){
ll n, i, sum=0, res=0;
cin>>n;
vector<pair<ll, ll>> a(n);
set<ll> s;
for(i=0;i<n;++i){
cin>>a[i].first>>a[i].second;
}
sort(a);
for(i=0;i<n;++i){
s.insert(a[i].first - sum);
sum += a[i].second;
res = max(res, sum + *s.rbegin() - a[i].first);
}
cout<<res<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
srand(time(nullptr));
ll t=1;
// cin>>t;
for(;t>0;--t){
solve();
}
return 0;
}
