#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((ll)(x).size())
#define bit(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

#define INF bit(60)
#define pb push_back
#define mod 998244353
#define MOD 998244353

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

using namespace std;

//using namespace __gnu_pbds;

using uif=uint_fast64_t;
using ll=long long int;

int qp(int a,ll b){int ans=1;do{if(b&1)ans=1ll*ans*a%mod;a=1ll*a*a%mod;}while(b>>=1);return ans;}
int qp(int a,ll b,int mo){int ans=1;do{if(b&1)ans=1ll*ans*a%mo;a=1ll*a*a%mo;}while(b>>=1);return ans;}

int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};


#define FACSIZE 2002

ll invfac[FACSIZE];
ll fac[FACSIZE];

ll mod_pow(ll ,ll );
ll mod_add(ll ,ll );
ll mod_mul(ll ,ll );
ll mod_div(ll ,ll );
void make_fact(ll );
void make_invfact(ll );


int main(void){

  ll n;
  cin>>n;

  if(n==1){
    cout << 1 << endl;
    return 0;
  }

  using pa=pair<ll,ll>;
  vector<pa> p(n);
  
  rep(i,n) cin>>p[i].first>>p[i].second;
  sort(begin(p),end(p));

  //map<ll,ll> lm;
  //set<ll> ls;
  //set<ll> rs;
  __gnu_pbds::tree< ll , __gnu_pbds::null_type, less< ll >, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ls;
  __gnu_pbds::tree< ll , __gnu_pbds::null_type, less< ll >, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> rs;

  //map<ll,ll> rm;
  vector<vector<ll>> lv(n,vector<ll>(2));
  vector<vector<ll>> rv(n,vector<ll>(2));

  rep(i,n){
    if(i==0){
      lv[i][0]=0;
      lv[i][1]=0;
    }
    else{
      //auto itr=lm.upper_bound( p[i].second );
      auto itr=ls.order_of_key( p[i].second );
      //cout << itr->first << endl;
      //lv[i][0]= distance( begin(ls),itr ) ;
      lv[i][0]= itr;
      //lv[i][1]= distance( itr,end(lm));
      lv[i][1]= i-lv[i][0];
    }
    //lm[ p[i].second ]=p[i].first;
    ls.insert( p[i].second );
  }
  rep_r(i,n){
    if(i==n-1){
      rv[i][0]=0;
      rv[i][1]=0;
    }
    else{
      //auto itr=rm.upper_bound( p[i].second );
      //auto itr=rs.upper_bound( p[i].second );
      auto itr=rs.order_of_key( p[i].second );
      //cout << itr->first << endl;
      //rv[i][0]= distance( begin(rs),itr ) ;
      rv[i][0]= itr;
      //rv[i][1]= distance( itr,end(rm));
      rv[i][1]= n-1-i - rv[i][0];
    }
    //rm[ p[i].second ]=p[i].first;
    rs.insert( p[i].second );
  }  
  /*
  for(auto v:lv){
    cout << v[0] << "," << v[1] << endl;
  }
  cout << endl;
  //*/
  /*
  for(auto v:rv){
    cout << v[0] << "," << v[1] << endl;
  }
  //*/
  ll ans=0;

  ll all=mod_pow(2,n)-1;

  rep(i,n){
    
    //ans=mod_add(ans,1);

    //ll a= ( mod_pow(2LL,rv[i][0]) )-1;
    ll a=rv[i][0];
    ll b=rv[i][1];
    ll c=lv[i][0];
    ll d=lv[i][1];
    //ll b= ( mod_pow(2LL,rv[i][1]) )-1;

    //ll c= ( mod_pow(2LL,lv[i][0]) )-1;
    //ll d= ( mod_pow(2LL,lv[i][1]) )-1;

    ll A=mod_pow(2LL,a)-1,B=mod_pow(2LL,b)-1,C=mod_pow(2LL,c)-1,D=mod_pow(2LL,d)-1;
    ans=(ans+all+10LL*MOD-A-B-C-D-A*B%MOD-C*D%MOD-A*C%MOD-B*D%MOD)%MOD;
    //ll cal=(mod_pow(2LL,n) -1 + 10LL+mod - val1-val2-val3-val4-mod_mul(val1,val2)-mod_mul(val3,val4)-mod_mul(val1,val3)-mod_mul(val2,val4) )%mod;
    //ans=mod_add(ans,cal);

  }

  cout << ans << endl;

  return 0;

}

ll mod_pow(ll x,ll r){
  if(r==0) return 1;
  else if(r==1) return x%mod;
  else if(r%2==0){
    ll t=mod_pow(x,r/2)%mod;
    return t*t %mod;
  } 
  else{
    ll t=mod_pow(x,r/2)%mod;
    ll k= t*t %mod;
    return k*x%mod;
  } 
}
ll mod_add(ll a,ll b){
  return (a+b)%mod;
}

ll mod_mul(ll a,ll b){
  return (a*b)%mod;
}

ll mod_div(ll a,ll b){
  return mod_mul(a,mod_pow(b,mod-2));
}

void make_fact(ll n){
  fac[0]=1;
  rep(i,n){
    fac[i+1]=mod_mul(fac[i],i+1);
  }  
}

void make_invfact(ll n){
  invfac[n]= mod_pow( fac[n] ,mod-2);
  for(int i=n-1;i>=0;i--){
    invfac[i]=mod_mul(invfac[i+1],i+1);
  }

}

Measured memory_bytes: 50304