#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e17;
const int mod2 = 1e9 + 7;
const int mod1 = 998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, l, r, mid, l2, r2, center;
int i, s10, s12,k1,k2,s11;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
///modwwe
phongbeo();
// checktime
}
vector<int> v[1000001];
ib a[1000001];
int c[1000001];
vector<int> v2[8000001];
bool cmp(ib a,ib b)
{
return a.a<b.a;
}
void dfs(int x)
{
for(auto f:v[x])
{
if(c[f]==c[x]){cout<<0; exit(0);}
if(!c[f]){
c[f]=3-c[x];
dfs(f);
}
}
}
void upd(int node,int l,int r,int l1,int r1,int x)
{
if(l>r1||r<l1) return;
if(l>=l1&&r<=r1)
{
v2[node].pb(x);
return;
}
int mid=l+r>>1;
upd(node<<1,l,mid,l1,r1,x);
upd(node<<1|1,mid+1,r,l1,r1,x);
}
void get(int node,int l,int r,int l1,int x)
{
for(auto f:v2[node])
v[x].pb(f),
v[f].pb(x);
if(l==r) return;
int mid=l+r>>1;
if(l1<=mid)get(node<<1,l,mid,l1,x);
else get(node<<1|1,mid+1,r,l1,x);
}
void phongbeo()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i].a>>a[i].b;
sort(a+1,a+1+n,cmp);
for(int i=n;i>=1;--i)
{
get(1,1,n*2,a[i].b,i);
upd(1,1,n*2,a[i].a,a[i].b,i);
}
s4=1;
for(int i=1;i<=n;i++)
if(!c[i])
{
c[i]=1;
s4=(s4<<1);
if(s4>=mod2)s4-=mod2;
dfs(i);
}
cout<<s4;
}
