#include<stdio.h>
long n;
long a[100001];
long b[100001];
long t[100001];
long cautbin (long val)
{
	long st , dr , m ,poz=1;
	st=1;
	dr=n;
	while (st<=dr)
	{
		m=(st+dr)/2;
		if (b[m]<=val)
		{
			poz=m;
			st=m+1;
		}
		else
			dr=m-1;
	}
	return poz;
}

long max (long x , long y)
{
	if (x>y)
		return x;
	return y;
}

long part(long st , long dr)
{
	long p,m,i,j,aux;
	i=st-1;
	j=dr+1;
	m=(st+dr)/2;
	p=b[m];
	while (1)
	{
		do {++i;}while (b[i]<p);
		do {--j;}while (b[j]>p);
		if (i<j)
		{
			aux=b[i];
			b[i]=b[j];
			b[j]=aux;
			aux=a[i];
			a[i]=a[j];
			a[j]=aux;
		}
		else
			return j;
		
	}
}

void quick(long st , long dr)
{
	long sp;
	if (st<dr)
	{
		sp=part(st,dr);
		quick(st,sp);
		quick(sp+1,dr);
	}
}

int main()
{
	long i,j,u=0,g;
	
	freopen("heavymetal.in","r",stdin);
	freopen("heavymetal.out","w",stdout);
	
	scanf("%ld",&n);
	for (i=1;i<=n;i++)
		scanf("%ld%ld",&a[i],&b[i]);
	quick(1,n);
	for (i=1;i<=n;i++)
	{
		t[i]=t[i-1];
		for (j=u;j<=n;j++)
		{
			if (b[j]==b[i])
			{
				g=cautbin(a[j]);
				t[i]=max(t[i],t[g]+b[j]-a[j]);
			}
			else
			{
				if (b[j]>i)
				{
					u=j;
					break;
				}
			}
		}
	}
	printf("%ld\n",t[n]);
	return 0;
}