#include <iostream>
using namespace std;

int a[100010], b[100010], maxn, maxid;

int main() 
{
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i] >> b[i];
		if(b[i] > a[i] - b[i])b[i] = a[i] - b[i];
		if(a[i] - b[i] > maxn)
		{
			maxn = a[i] - b[i];
			maxid = i;
		}
		
	}
	int ans = 0;
	for(int i = 1; i <= n; i++)
	{
		if(i != maxid)ans = max(maxn + a[i] - b[i], ans);
	}
	cout << ans << endl;
	return 0;
}