#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll mod = 1e9 + 7;
void upd(ll& a, const ll& b) { a = (a + b) % mod; }
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
vector<ll> dp(n + 1, 0);
dp[0] = 1;
ll ans = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 0; j < i; j++)
{
if (a[j] < a[i]) upd(dp[i], dp[j]);
}
upd(ans, dp[i]);
}
cout << ans << "\n";
return 0;
}
