// template version 1.12
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF=1e18;
const int MOD=1e9+7; //}}}

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}

// zip: a = [3, 10, 5, 5, 2]
vector<int> unzipper; // [2, 3, 5, 10]
map<int, int> zipper; // {2:0, 3:2, 5:3, 10:4}
vector<int> zipped; // [2, 4, 3, 3, 0]
auto zip=[&](vector<int> a){ //{{{
  int n = sz(a);
  unzipper = vector<int>(n); zipped = vector<int>(n);
  rep(i, n) { unzipper[i]=a[i]; }
  uni(unzipper);
  rep(i, sz(unzipper)){ zipper[unzipper[i]] = i; }
  rep(i, n){ zipped[i] = zipper[a[i]]; }
  return 0;
}; /// }}}

int mod;
struct mint { //逆元などを使いたければmint2{{{
  int x;
  mint(int x=0):x(x%mod){}
  mint& operator+=(const mint a) {
    (x += a.x) %= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    (x += mod-a.x) %= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res+=a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res-=a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res*=a;
  }
};
ostream& operator<<(ostream& os, const mint& a){
  os << a.x;
  return os;
} //}}}

template<typename T> struct BIT {//{{{
  int n;
  vector<T> dat;

  BIT(int n=0){/*{{{*/
    initialize(n);
  }/*}}}*/

  void initialize(int nin){/*{{{*/
    n = nin;
    dat.resize(n);
    for(int i = 0; i<n; i++) dat[i] = 0;
  }/*}}}*/

  T sum(int i){/*{{{*/
    T s = 0;
    while(i >= 0){
      s += dat[i];
      i = (i & (i+1)) - 1;
    }
    return s;
  }/*}}}*/

  T sum_between(int i, int j){/*{{{*/
    if(i > j) return 0;
    return sum(j) - sum(i-1);
  }/*}}}*/

  void add(int i, T x){/*{{{*/
    while(i < n){
      dat[i] += x;
      i |= i+1;
    }
  }/*}}}*/

  int lower_bound(T x){ // a[0]+...+a[ret] >= x{{{
    int ret = -1;
    int k = 1;
    while(2*k <= n) k <<= 1;
    for( ;k>0; k>>=1){
      if(ret+k < n && dat[ret+k] < x){
        x -= dat[ret+k];
        ret += k;
      }
    }
    return ret + 1;
  }/*}}}*/
};//}}}

vi p;
int solve(){
  mod = 998244353;
  int n;cin>>n;
  vi x(n), y(n);
  vi v;
  v.pb(-INF); v.pb(+INF);
  rep(i,n){
    cin>>x[i]>>y[i];
    v.pb(x[i]); v.pb(y[i]);
  }

  p = vi(200001);
  p[0] = 1;
  rep(i, 1, 200001){ p[i] = p[i-1]*2%mod; }

  zip(v);
  dump(unzipper); dump(zipper);
  int m = sz(zipper);
  dump(m);
  vector<pii> pos;
  rep(i,n){
    x[i] = zipper[x[i]];
    y[i] = zipper[y[i]];
    pos.pb(mp(x[i], y[i]));
  }
  sort(all(pos));
  dump(pos);

  BIT<int> L(m), R(m);
  rep(i, 1, n){
    R.add(pos[i].second, 1);
  }


  mint ans = 0;
  rep(i, n){
    int a=0, b=0, c=0, d=0;

    a += L.sum(pos[i].second);
    b += i - a;
    c += R.sum(pos[i].second);
    d += (n-i-1) - c;
    dump(a,b,c,d);

    mint v = 0;
    v += p[a+b];
    v += p[c+d];
    v += p[a+c];
    v += p[b+d];
    v -= p[a];
    v -= p[b];
    v -= p[c];
    v -= p[d];
    v += 1;

    ans += p[n-1];
    ans += mint(p[n-1])-v;

    L.add(pos[i].second, 1);
    if (i+1<n) R.add(pos[i+1].second, -1);
  }
  cout << ans << endl;
  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}


Measured memory_bytes: 50484