#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            

                      
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                            
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
}  
                                
                int pr[1200010];
                int inv[1200010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }

                
    			int comb(int nn,int rr){
    				if(rr<0 || rr>nn || nn<0) return 0;
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<=ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                		inv[ert]=beki(pr[ert],mod-2,mod);
                	for(int i=ert-1;i>=0;i--){
                		inv[i]=inv[i+1]*(i+1)%mod;
                	}
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
//    mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
      
       
       
                               //----------------kokomade tenpure------------


struct seg_zenbu{
	//       1
	//   2        3
	// 4   5   6    7
	
	
	private:
	public:
	
	// (1<<15)=32768
	// 1<<16 = 65536
	// 1<<17 = 131072
	// 1<<18 = 262144
	
	int cor=(1<<18);
	int max_inf=inf*1000000ll;
	int min_inf=-max_inf;
	
	
	struct node{
		int mi;
		int ma;
		int su;
	};
	
	struct sayo{
		int a;
		int b;
		
		
		bool operator==(sayo v){
			return a==v.a && b==v.b;
		}
	
	};
	
	sayo yuni={1,0};
	
	node node_merge(node x,node y){
		return {min(x.mi,y.mi),max(x.ma,y.ma),(x.su+y.su)%inf};
	}
	
	
	vector<node> vec;
	vector<sayo> lazy;
	void shoki1(){
		vec.resize(2*cor+3, {0,0,0});
		lazy.resize(2*cor+3,yuni);
	}
	void shoki2(){
		for(int i=cor-1;i>0;i--) vec[i]=node_merge(vec[2*i],vec[2*i+1]);
	}
	
	sayo merge_sayo(sayo x,sayo y){
		int t1=x.a*y.a;
		int t2=x.b*y.a+y.b;
		return {t1%inf,t2%inf};
	}
	
	node node_sayo(node x,sayo y,int l,int r){
		if(y.a==0){
			return {y.b,y.b,y.b*(r-l)%inf};
		}
		else if(y.a>0){
				return {(x.mi*y.a+y.b)%inf,(x.ma*y.a+y.b)%inf,(x.su*y.a+(r-l)*y.b)%inf};
		}
		else{
				return {(x.ma*y.a+y.b)%inf,(x.mi*y.a+y.b)%inf,(x.su*y.a+(r-l)*y.b)%inf};
		}
	}
		
	void chien(int k,int l,int r){
		if(lazy[k]==yuni) return;
		if(l+1<r){
			vec[k]=node_sayo(vec[k],lazy[k],l,r);
			lazy[2*k]=merge_sayo(lazy[2*k],lazy[k]);
			lazy[2*k+1]=merge_sayo(lazy[2*k+1],lazy[k]);
			lazy[k]=yuni;
		}
		else {
			vec[k]=node_sayo(vec[k],lazy[k],l,r);
			lazy[k]=yuni;
		}
	}
	
	node rangeshori(int a,int b,sayo w, int k=1,int l=0,int r=-3){
		//[a,b)を w.a倍してw.bをたす
		if(r<0) r=cor;
		
		if(a<=l && r<=b){
			lazy[k]=merge_sayo(lazy[k],w);
			chien(k,l,r);
			return vec[k];
		}
		if(r<=a || b<=l){
			chien(k,l,r);
			return vec[k];
		}
		
		chien(k,l,r);
//	cout<<k<<" "<<l<<" "<<r<<endl;
		node w1=rangeshori(a,b,w,k*2,l,(l+r)/2);
		node w2=rangeshori(a,b,w,k*2+1,(l+r)/2,r);
		vec[k]=node_merge(w1,w2);
		return vec[k];
	}
	
	////////////////////////
	////////////////////////
	//       区間 update ///
	////////////////////////	
	////////////////////////
	
	void range_upd(int l,int r,int v){
			rangeshori(l,r,(sayo){0,v});
	}
	
	
	
	////////////////////////
	////////////////////////
	//       区間 add    ///
	////////////////////////	
	////////////////////////
	
	
	void range_add(int l,int r,int v){
			rangeshori(l,r,(sayo){1,v});
	}
	// [a,b)
	// k-th node
	// k no kukanha [l,r)
	

	
	int getsum(int a,int b,int k=1,int l=0,int r=-1){
		if(r<0) r=cor;
		chien(k,l,r);
		if(r<=a || b<=l){// 区間外
			return 0;
		}
		
		if(a<=l && r<=b){// 完全含む
			
			return vec[k].su;
		}
		int w1=getsum(a,b,k*2,l,(l+r)/2);
		int w2=getsum(a,b,k*2+1,(l+r)/2,r);
		return (w1+w2)%inf;
	}
};

bool hikaku(pa a,pa b){
	return a.second<b.second;
}

int solve(int n,vector<pa> ve){
	sort(ve.begin(),ve.end(),hikaku);
//	for(auto v:ve)cout<<v.first<<" "<<v.second<<endl;
	
seg_zenbu ss;
	ss.shoki1();
	ss.shoki2();
	ss.range_upd(0,1,1);
	
	
	for(auto v:ve){
		int wa=ss.getsum(v.first-1,v.second+1)%inf;
		
		ss.rangeshori(0,v.first-1,{2,0});
		ss.range_add(v.second,v.second+1,wa);
		ss.rangeshori(v.second+1,ss.cor,{2,0});
		
	}
	
	return ss.getsum(n,n+1)%inf;
}

 signed main(){
 	

    	       cin.tie(0);
   			ios::sync_with_stdio(false);

 	
 	int n;
 	cin>>n;
 	
 	vector<pa4> ve(n);
 	for(int i=0;i<n;i++){
 		cin>>ve[i].x>>ve[i].y;
 	}
 	
 	set<int> se;
 	map<int,int>ma;
 	
 	for(int i=0;i<n;i++)se.insert(ve[i].x);
 	int cn=1;
 	for(auto it=se.begin();it!=se.end();it++){
 		ma[*it]=cn;
 		cn++;
 	}
 	for(int i=0;i<n;i++)ve[i].x=ma[ve[i].x];
 	se.clear();
 	ma.clear();
 	cn=1;
 	
 	
 	
 	for(int i=0;i<n;i++)se.insert(ve[i].y);
 	cn=1;
 	for(auto it=se.begin();it!=se.end();it++){
 		ma[*it]=cn;
 		cn++;
 	}
 	for(int i=0;i<n;i++)ve[i].y=ma[ve[i].y];
 	
 	sort(ve.begin(),ve.end());
 	vector<int> F(n),H(n);
 	
 	F[0]=ve[0].y;
 	for(int i=1;i<n;i++){
 		F[i]=max(F[i-1],ve[i].y);
 	}
 	H[n-1]=ve[n-1].y;
 	for(int i=n-2;i>=0;i--){
 		H[i]=min(H[i+1],ve[i].y);
 	}
 	for(int i=0;i<n;i++){
 		ve[i].z=H[i];
 		ve[i].w=F[i];
 		
 //		cout<<ve[i].x<<" "<<ve[i].y<<" "<<ve[i].z<<" "<<ve[i].w<<endl;
 	}
 	
 	
 	
 	vector<pa> W;
 	for(int i=0;i<n;i++){
 			W.pb({ve[i].z,ve[i].w});
 	}
 	int g=solve(n,W);
 
 	cout<<g<<endl;
 	
 	return 0;
  }
  

Measured memory_bytes: 61036