/*
* Created at 11:34 AM on 13 May, 2022
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <set>
#include <numeric>
#include <cassert>
#include <functional>
using namespace std;
#define rep(i, a, b) for(auto (i)=a;(i)<(b);(i)++)
#define list(i, N) for(auto (i)=0;(i)<(N);(i)++)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SZ(x) (int)(x).size()
#define vt vector
#define trav(a, x) for(auto& (a): (x))
#define DO if(true)
#define mp make_pair
#define pb push_back
#define eb emplace_back
//#define int int64_t
typedef vector<int> vi;
typedef pair<int, int> pi;
#define mod 1000000007
void setIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
template<typename T>
void read(vector<T> &a, int n) {
a.resize(n);
for (auto &x: a) cin >> x;
}
template<class T, class U>
ostream &operator<<(ostream &out, const pair<T, U> &v) {
out << "(";
out << v.first << ", " << v.second;
return out << ")";
}
template<class T>
ostream &operator<<(ostream &out, const vector<T> &v) {
out << "[";
list(i, SZ(v)) {
if (i) out << ", ";
out << v[i];
}
return out << "]";
}
template<typename T>
void print(vector<T> &a) {
for (const auto &x: a) cout << x << ' ';
cout << '\n';
}
template<typename T>
void MOD(T &x, int m = mod) {
x %= m;
if (x < 0) x += m;
}
#define trace(...) dbg(#__VA_ARGS__, __VA_ARGS__)
template<typename T>
void dbg(const char *name, T &&arg1) {
cout << name << " : " << arg1 << '\n';
}
template<typename T, typename... U>
void dbg(const char *names, T &&arg1, U &&... args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
dbg(comma + 1, args...);
}
template<class T>
void read(T &x) {
cin >> x;
}
template<class T, class... U>
void read(T &t, U &... u) {
read(t);
read(u...);
}
int gcd(int a, int b) { return !a ? b : gcd(b % a, a); }
int ceil_div(int a, int b) { return (a + b - 1) / b; }
using ll = int64_t;
const int N = 505;
int n;
vt<pi> a;
void sub(int& x){
while(x >= mod){
x -= mod;
}
}
int32_t main() {
setIO();
read(n);
a.resize(n);
trav(c, a){
read(c.first, c.second);
}
//Initialization
vt<vi> dp(n + 1, vi(n + 1, 0));
//Base Case
list(i, n) {
dp[n][i] = 1;
}
//Computation
for(int idx = n - 1; idx >= 0; idx--){
for(int prev = 0; prev <= n; prev++){
int& res = dp[idx][prev];
res = 0;
//Either Pick
if(prev == n or a[idx] > a[prev]) {
res += dp[idx + 1][idx];
sub(res);
}
//or not
res += dp[idx + 1][prev];
sub(res);
}
}
cout << dp[0][n] << '\n';
return 0;
}
