#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
#define chmin(x, y) (x = min(x, y))
#define chmax(x, y) (x = max(x, y))
/********* DEBUG *********/
template <typename T>
void outvec(const vector<T>& Z){
for (const T& x : Z)
cout << x << ' ';
cout << "\n";
}
void printVariable(const any& var) {
if (!var.has_value()) {
cout << "null";
return;
}
if (var.type() == typeid(int)) {
cout << any_cast<int>(var);
} else if (var.type() == typeid(double)) {
cout << any_cast<double>(var);
} else if (var.type() == typeid(float)) {
cout << any_cast<float>(var);
} else if (var.type() == typeid(char)) {
cout << any_cast<char>(var);
} else if (var.type() == typeid(bool)) {
cout << (any_cast<bool>(var) ? "true" : "false");
} else if (var.type() == typeid(string)) {
cout << any_cast<string>(var);
} else if (var.type() == typeid(const char*)) {
cout << any_cast<const char*>(var);
} else if (var.type() == typeid(long long)) {
cout << any_cast<long long>(var);
} else {
cout << "[unknown type]";
}
}
template<typename... Args>
void outval(Args... args) {
vector<any> variables = {args...};
for (size_t i = 0; i < variables.size(); ++i) {
printVariable(variables[i]);
if (i != variables.size() - 1) {
cout << " ";
}
}
cout << "\n";
}
#define sp << " " <<
#define fi first
#define se second
/********* DEBUG *********/
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll inf = 1e18;
const ll mxN = 100005;
ll check(vector<ll> vec){
unordered_set<ll> seen;
for (int i = 1; i <= vec.size(); i++){
ll sum = 0;
for (int j = 0; j < vec.size(); j++){
if (j >= i)
seen.insert(sum);
sum += vec[j];
if (j >= i)
sum -= vec[j-i];
}
seen.insert(sum);
}
return seen.size();
}
void solve(){
ll n;
cin >> n;
vector<ll> vec(n);
for (auto &i : vec)
cin >> i >> i;
vector<ll> dp(n, 1);
for (int i = 1; i < n; i++)
for (int j = 0; j < i; j++)
if (vec[i] > vec[j])
dp[i] = (dp[i] + dp[j]) % MOD;
ll sum = 0;
for (int i = 0; i < n; i++)
sum = (sum + dp[i]) % MOD;
outval(sum);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
//cin >> t;
while (t--) {
solve();
}
}
