#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
template<typename T>
struct Segment_Tree {
	typedef function<T(T, T)> F;

	ll n;
	F f;//モノイドとしての演算(最小値、和　など)
	T unit;//単位元

	ll size;
	vector<T> seg;

	Segment_Tree(ll n0, F f0, T unit0) {
		n = n0;
		f = f0;
		unit = unit0;

		size = 1;
		while (size < n) {
			size *= 2;
		}
		seg.assign(2 * size, unit);
	}


	void update(ll k, T x) {//k番目の要素をxに更新
		k += size - 1;
		seg[k] = x;
		while (k > 1) {
			k /= 2;
			seg[k] = f(seg[2 * k], seg[2 * k + 1]);
		}
	}



	T query_prep(ll a, ll b, ll k, ll l, ll r) {//[a,b)とkに対応する区間[l,r)の共通部分でクエリ
		if (b <= l || a >= r) { return unit; }
		if (a <= l && r <= b) { return seg[k]; }

		T v1 = query_prep(a, b, 2 * k, l, (l + r) / 2);
		T v2 = query_prep(a, b, 2 * k + 1, (l + r) / 2, r);
		return f(v1, v2);

	}

	T query(ll a, ll b) {
		return query_prep(a, b, 1, 1, size + 1);
	}

};



int main() {
	ll N;
	cin >> N;

	vector<pair<ll, ll>> P(N + 1);
	repn(i, N) {
		cin >> P[i].first >> P[i].second;
	}
	sort(++P.begin(), P.end());

	vll V(N + 1);
	repn(i, N)V[i] = P[i].second;

	//repn(i, N)cout << V[i] << " ";
	//cout << endl;

	vll mx(N + 2), mn(N + 2);
	mx[0] = 0;
	repn(i, N)mx[i] = max(mx[i - 1], V[i]);
	mn[N+1] = INF;
	for (ll i = N; i >= 1; i--) { mn[i] = min(mn[i + 1], V[i]); }

	Segment_Tree<ll> sg(N, [](ll a, ll b) {return min(a, b); }, INF);

	vector<pair<ll, ll>> z(N + 1, {0,0});
	repn(i, N)z[i] = { V[i],i };
	sort(z.begin(), z.end(), greater<pair<ll, ll>>());

	
	vll nxt(N + 1);
	rep(i, N+1) {
		ll x = z[i].second;
		//cout << x << " ";

		for (ll y = x; y<=N; y++) {
			if (mx[y] > V[x]) { break; }
			//cout << y << endl;

			ll l = y + 1;
			ll r = N + 2;
			while (r - l > 1) {
				ll m = (r + l) / 2;
				//cout << m << endl;
				ll val = sg.query(y + 1, m);
				//cout << m << " " << val << " " << mn[m] << endl;
				if (val < mn[m]) { r = m; }
				else { l = m; }
			}

			nxt[y] = l;
			//cout << nxt[y] << endl;
		}

		if(x!=0)sg.update(x, V[x]);
	}

	vmint dp(N + 2, 0), rdp(N + 3, 0);
	dp[N + 1] = 1;
	rdp[N + 1] = 1;

	for (ll i = N; i >= 0; i--) {
		dp[i] = rdp[i + 1] - rdp[nxt[i]+1];
		rdp[i] = rdp[i + 1] + dp[i];
	}
	cout << dp[0] << endl;

}


Measured memory_bytes: 23008