#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define ep emplace
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define uniquev(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define mem(f,x) memset(f , x , sizeof(f))
#define sz(x) (ll)(x).size()
#define __lcm(a, b) (1ll * ((a) / __gcd((a), (b))) * (b))
#define mxx *max_element
#define mnn *min_element
#define cntbit(x) __builtin_popcountll(x)
#define len(x) (int)(x.length())
const int N = 2e6 + 10;
int id[N], col[N];
bool insersect (vector <pair <int, int>> seg) {
sort(all(seg));
set <int> save;
for (auto x : seg) {
auto it = save.lower_bound(x.f);
if (it != save.end() && *it < x.s)
return 1;
save.insert(x.s);
}
return 0;
}
ll solve() {
vector <pair <int, int>> seg;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
seg.pb({a, b});
}
sort(all(seg));
set <int> save;
vector <pair <int, int>> A, B;
int cnt = 0;
for (int i = 0; i < n; i++) {
id[seg[i].f] = id[seg[i].s] = i;
auto it = save.lower_bound(seg[i].f);
if (it == save.end() || *it > seg[i].s) {
cnt++;
} else {
col[i] = 1 - col[id[*it]];
}
if (col[i] == 0) {
A.pb(seg[i]);
} else {
B.pb(seg[i]);
}
save.insert(seg[i].s);
};
if (insersect(A) || insersect(B))
return 0;
ll ans = 1, mod = 1e9 + 7;
for (int i = 1; i <= cnt; i++) {
ans = (ans + ans) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
//cin >> t;
while (t--) {
cout << solve() << '\n';
}
return 0;
}
