#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 2e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
vector<ll> adj[N];
vector<ll> col(N,-1);
bool bip = true;
void dfs1(ll u){
ll want = col[u]^1;
trav(v,adj[u]){
if(col[v] != -1){
if(col[v] != want){
bip = false;
}
}
else{
col[v] = want;
dfs1(v);
}
}
}
void solve(int test_case)
{
ll n; cin >> n;
vector<pll> a(n+5);
rep1(i,n) cin >> a[i].ff >> a[i].ss;
rep1(i,n){
for(int j = i+1; j <= n; ++j){
auto [l1,r1] = a[i];
auto [l2,r2] = a[j];
if(l1 > l2) swap(l1,l2), swap(r1,r2);
if(l1 < l2 and l2 < r1 and r1 < r2){
adj[i].pb(j), adj[j].pb(i);
}
}
}
bool edge[n+5][n+5];
memset(edge,0,sizeof edge);
rep1(u,n){
trav(v,adj[u]){
edge[u][v] = 1;
}
}
ll ans = 1;
rep1(i,n){
if(col[i] != -1) conts;
col[i] = 0;
dfs1(i);
ans = ans*2%MOD;
}
bip = true;
rep1(u,n){
trav(v,adj[u]){
trav(w,adj[v]){
if(edge[u][w]){
bip = false;
}
}
}
}
if(!bip) ans = 0;
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
