#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,a[SI],b[SI],dp[505][505];
//map <pair <ll,pair<ll,ll> >,ll> dp,vis;
ll solve(int in,int li)
{
if (in==n+1)
{
return li!=0;
}
if (dp[in][li]!=-1)
return dp[in][li];
ll ret=0;
if (li==0)
{
ret=solve(in+1,in);
ret%=MOD;
ret+=solve(in+1,li);
}
else
{
if (a[in]>a[li])
ret+=solve(in+1,in),ret%=MOD;
ret+=solve(in+1,li);
}
return dp[in][li]=ret%MOD;
}
int main()
{
fast
memset(dp,-1,sizeof dp);
cin>>n;
for (int i=1;i<=n;i++)
cin>>a[i]>>b[i];
cout << solve(1,0);
// use scanf not cin
return 0;
}
