#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define creeper_bonc ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
#define ins insert
#define nl endl
//#define int long long
const int imax = INT_MAX;
const int imin = INT_MIN;
void _()
{
int n; cin>>n;
vector <pii> v(n + 1);
int sum[n + 1], mx[n + 1];
for(int i = 0;i < n;i++) cin>>v[i].fi>>v[i].se;
sort(all(v));
for(int i = 1;i <= n;i++) sum[i] = sum[i - 1] + v[i].se;
int ans = imin;
for(int i = 2;i <= n;i++)
{
for(int j = 1;j <= i;j++) ans = max(ans, sum[i] - sum[j - 1] - v[i].fi + v[j].fi);
}
cout<<ans;
}
signed main()
{
creeper_bonc
int t=1;
//cin>>t;
while(t--) {
_();
cout<<endl;}
}
/*Author: Davud*/
