#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

struct SegT {
private:
	int n; vector<modint> node;
	vector<bool> lazy;
public:
	SegT(vector<modint> v) {
		int sz = v.size();
		n = 1;
		while (n < sz)n <<= 1;
		node.resize(2 * n - 1, 0);
		lazy.resize(2 * n - 1, 0);
		rep(i, sz) {
			node[i + n - 1] = v[i];
		}
		per(i, n - 1) {
			node[i] = node[2 * i + 1]+node[2 * i + 2];
		}
	}
	void eval(int k, int l, int r) {
		if (lazy[k]) {
			node[k] = 0;
			if (r - l > 1) {
				lazy[2 * k + 1] = true;
				lazy[2 * k + 2] = true;
			}
			lazy[k] = false;
		}
	}
	void add(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return;
		if (a <= l && r <= b) {
			lazy[k] =!lazy[k]; eval(k, l, r);
		}
		else {
			add(a, b, k * 2 + 1, l, (l + r) / 2);
			add(a, b, k * 2 + 2, (l + r) / 2, r);
			node[k] = node[k * 2 + 1]+node[k * 2 + 2];
		}
	}
	modint query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return 0;
		if (a <= l && r <= b)return node[k];
		else {
			modint vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			modint vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return vl+vr;
		}
	}
};

vector<int> loc[1 << 18];
modint dp[1 << 18];

void yaru(int l, int r) {
	if (l == r)return;
	int m = (l + r) / 2;
	yaru(l,m);
	vector<modint> sta;
	modint s = 0;
	Rep1(i, l, m) {
		sta.push_back(dp[i]);
	}
	SegT st(sta);
	Rep1(i, l, m) {
		rep(j, loc[i].size()) {
			int le = loc[i][j];
			if (le >= l) {
				st.add(0, le - l+1);
			}
		}
	}
	Rep1(i, m + 1, r) {
		rep(j, loc[i].size()) {
			int le = loc[i][j];
			if (le < l)continue;
			else if (le <= m) {
				st.add(0, le - l + 1);
			}
			else {
				st.add(0, m - l + 1);
			}
		}
		modint z = st.query(0, m - l + 1);
		dp[i] += z;
	}
	yaru(m + 1, r);
}

void solve() {
	int n; cin >> n;
	vector<P> a(n);
	rep(i, n) {
		int x, v; cin >> x >> v;
		a[i] = { x,v };
	}
	sort(a.begin(), a.end());
	vector<int> mas(n);
	mas[0] = a[0].second;
	rep1(i, n - 1) {
		mas[i] = max(mas[i - 1], a[i].second);
	}
	vector<int> mis(n);
	mis[n-1] = a[n-1].second;
	for (int i = n - 2; i >= 0; i--) {
		mis[i] = min(mis[i + 1], a[i].second);
	}
	rep(i, n) {
		int id = lower_bound(mas.begin(), mas.end(), a[i].second) - mas.begin();
		int le = id;
		id = lower_bound(mis.begin(), mis.end(), a[i].second) - mis.begin();
		int ri = id - 1;
		if (ri < i)ri = i;
		loc[ri + 2].push_back(le);
		//cout << "!" << endl;
		//cout << le << " " << ri + 2 << endl;
	}
	rep(i, n + 2)sort(all(loc[i]));
	dp[0] = 1;
	yaru(0, n + 1);
	modint ans = dp[n+1];
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}


Measured memory_bytes: 40240