#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define N 500005
#define LL long long
#define mo 1000000007
using namespace std;
LL f[N],ans,sum[N];
int a[N][2],d[N],n,st[N],top,ap[N][2],bz[N],dc[N],d2[N],dw[N];
bool cmp(int x,int y)
{
return (a[x][0]<a[y][0])||(a[x][0]==a[y][0]&&a[x][1]<a[y][1]);
}
bool cmp2(int x,int y)
{
return a[x][1]<a[y][1];
}
bool cmp3(int x,int y)
{
return (ap[x][1]<ap[y][1]||ap[x][1]==ap[y][1]&&ap[x][0]<ap[y][0]);
}
int main()
{
cin>>n;
fo(i,1,n) scanf("%d%d",&a[i][1],&a[i][0]),d[i]=i;
sort(d+1,d+n+1,cmp);
int m=0;
fo(i,1,n) a[d[i]][0]=i;
sort(d+1,d+n+1,cmp2);
int mx=0;
fo(i,1,n)
{
mx=max(mx,a[d[i]][0]);
ap[d[i]][1]=mx;
d2[i]=i;
}
int mi=n+1;
fod(i,n,1)
{
mi=min(mi,a[d[i]][0]);
ap[d[i]][0]=mi;
}
f[0]=1;
sum[0]=1;
sort(d2+1,d2+n+1,cmp3);
LL ans=0;
dw[0]=0;
fo(i,1,n)
{
int u=d2[i];
dw[i]=ap[u][1];
int p=lower_bound(dw,dw+i+1,ap[u][0]-1)-dw;
f[i]=sum[i-1];
if(p>0) f[i]=(f[i]-sum[p-1]+mo)%mo;
sum[i]=(sum[i-1]+f[i])%mo;
if(ap[u][1]==n) ans=(ans+f[i])%mo;
}
printf("%lld\n",ans);
}