#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

int const maxn=1e6+;

int n,l[maxn],r[maxn],h,t,ans;

struct N{int l,r,pos;}q[maxn];

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++)scanf("%d%d",&l[i],&r[i]);

    h=; t=;

    for(int i=;i<=n;i++)

    {

        while(h<=t&&q[h].l>r[i])h++;

        ans=max(ans,i-q[h-].pos);//

        while(h<=t&&q[t].l<l[i])t--;

        q[++t].l=l[i]; q[t].r=r[i]; q[t].pos=i;

    }

    printf("%d\n",ans);

    return ;

}