#include <bits/stdc++.h>
using namespace std;
#define int long long int
const int MAXN = 1'000'001;
const int MOD = 1'000'000'007;
int n;
int A[MAXN], B[MAXN];
int modexp(int a, int p) {
if (p == 0) return 1;
if (p == 1) return a;
int ans = modexp(a, p / 2);
ans %= MOD;
ans *= ans;
ans %= MOD;
if (p % 2 == 1) ans *= a;
ans %= MOD;
return ans % MOD;
}
void solve() {
int ways = 0;
vector<vector<int>> adj(n, vector<int>());
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
int ci = i, cj = j;
if (A[ci] > A[cj]) swap(ci, cj);
if (A[ci] < A[cj] && A[cj] < B[ci] && B[ci] < B[cj]) {
adj[ci].push_back(cj);
adj[cj].push_back(ci);
}
}
}
int cmps = 0; bool bipartite = true;
vector<int> colour(n, -1);
queue<int> q;
for (int i = 0; i < n; i++) {
if (colour[i] != -1 || !bipartite) continue;
cmps++;
q.push(i);
colour[i] = 1;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (auto &el : adj[cur]) {
if (colour[el] == colour[cur]) {
bipartite = false;
break;
} else if (colour[el] == -1) {
colour[el] = colour[cur] == 1 ? 2 : 1;
q.push(el);
}
}
if (!bipartite) break;
}
}
ways = bipartite ? modexp(2, cmps) % MOD : 0;
cout << ways;
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
solve();
return 0;
}
