#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 100005
#define Inf 1000000000
using namespace std;
int n,i,j,p,q,nr;
long long sol;
long long w[Nmax],a[Nmax];
struct nod
{
    long long x;
    long long y;
}v[Nmax];
int cmp(const nod a,const nod b)
{
    return a.y<b.y;
}
int cb(long long val)
{
    int st=1,dr=nr,m;
    while (st<=dr)
    {
        m=(st+dr)/2;
        if (w[m]==val) return m;
        if (w[m]<val && w[m+1]>val) return m;
        if (w[m]<val) st=m+1;
        else dr=m-1;
    }
}
int main()
{
    freopen("heavymetal.in","r",stdin);
    freopen("heavymetal.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++)
    scanf("%lld %lld",&v[i].x,&v[i].y);
    sort(v+1,v+n+1,cmp);
    for (i=1;i<=n;i++)
    {
        if (v[i].y!=v[i-1].y)
        w[++nr]=v[i].y;
        p=cb(v[i].x);
        a[nr]=max(a[nr],a[nr-1]);
        a[nr]=max(a[nr],a[p]+v[i].y-v[i].x);
        if (a[nr]>sol) sol=a[nr];
    }
    printf("%lld",sol);
    return 0;
}