#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=(b-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x) x.begin(),x.end()
#define fs first
#define sd second
#define couts(x) cout << (x) << (" ")
#define coutn(x) cout << (x) << ("\n")
#define endl "\n"

template<typename T> std::istream &operator>>(std::istream &is, std::vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T1, typename T2> std::istream &operator>>(std::istream &is, std::pair<T1,T2> &p){is >> p.first >> p.second; return is; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::deque<T> &vec){ os << "deque["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> std::ostream &operator<<(std::ostream &os, const std::unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> std::ostream &operator<<(std::ostream &os, const std::unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }


template< typename Monoid >
struct SegmentTree {
  using F = function< Monoid(Monoid, Monoid) >;

  int sz;
  vector< Monoid > seg;

  const F f;
  const Monoid M1;

  SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz, M1);
  }

  void set(int k, const Monoid &x) {
    seg[k + sz] = x;
  }

  void build() {
    for(int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  void update(int k, const Monoid &x) {
    k += sz;
    seg[k] = x;
    while(k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  Monoid query(int a, int b) {
    Monoid L = M1, R = M1;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) L = f(L, seg[a++]);
      if(b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }

  Monoid operator[](const int &k) const {
    return seg[k + sz];
  }

  template< typename C >
  int find_subtree(int a, const C &check, Monoid &M, bool type) {
    while(a < sz) {
      Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
      if(check(nxt)) a = 2 * a + type;
      else M = nxt, a = 2 * a + 1 - type;
    }
    return a - sz;
  }


  template< typename C >
  int find_first(int a, const C &check) {
    Monoid L = M1;
    if(a <= 0) {
      if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
      return -1;
    }
    int b = sz;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) {
        Monoid nxt = f(L, seg[a]);
        if(check(nxt)) return find_subtree(a, check, L, false);
        L = nxt;
        ++a;
      }
    }
    return -1;
  }

  template< typename C >
  int find_last(int b, const C &check) {
    Monoid R = M1;
    if(b >= sz) {
      if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
      return -1;
    }
    int a = sz;
    for(b += sz; a < b; a >>= 1, b >>= 1) {
      if(b & 1) {
        Monoid nxt = f(seg[--b], R);
        if(check(nxt)) return find_subtree(b, check, R, true);
        R = nxt;
      }
    }
    return -1;
  }
};
int ZERO = 0;
SegmentTree<int> seg(200010, [](int a, int b) { return a+b; }, ZERO );


template<class T> using V = vector<T>;
template<class T> using V2 = V<V<T>>;
template<class T> using V3 = V<V2<T>>;
template<class T> using V4 = V<V3<T>>;
using P = pair<int,int>;
constexpr ll MOD = 998244353;

ll modpow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a % m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

void solve(){
  int n; cin >> n;
  V<P> v(n);
  FOR(i,0,n) cin >> v[i].sd >> v[i].fs;
  sort(ALL(v));
  FOR(i,0,n) {v[i].fs = i; swap(v[i].fs, v[i].sd);}
  sort(ALL(v));
  FOR(i,0,n) {v[i].fs = i;}
  //coutn(v);
  V<ll> twos(n+10); twos[0] = 1;
  FOR(i,0,n+5) twos[i+1]=(twos[i]<<1)%MOD;
  ll ans = twos[n-1];
  (ans *= n) %= MOD;
  //seg.build();
  FOR(i,0,n){
    int a, b, c, d, e, f; ll tmp = 1;
    a = seg.query(0,v[i].sd);
    e = v[i].sd;
    f = v[i].fs;
    b = e - a;
    c = n - f - b - 1;
    d = f - a;
    //couts(a); couts(b); couts(c); couts(d);
    seg.update(v[i].sd,1);
    (tmp *= (twos[a]-1))%=MOD;
    (tmp *= (twos[b]-1))%=MOD;
    (tmp *= (twos[c]-1))%=MOD;
    (tmp *= (twos[d]-1))%=MOD;
    (ans += tmp) %= MOD;
    tmp = 1;
    (tmp *= (twos[b]-1))%=MOD;
    (tmp *= (twos[c]-1))%=MOD;
    (tmp *= (twos[d]-1))%=MOD;
    (ans += tmp) %= MOD;
    tmp = 1;
    (tmp *= (twos[a]-1))%=MOD;
    (tmp *= (twos[c]-1))%=MOD;
    (tmp *= (twos[d]-1))%=MOD;
    (ans += tmp) %= MOD;
    tmp = 1;
    (tmp *= (twos[a]-1))%=MOD;
    (tmp *= (twos[b]-1))%=MOD;
    (tmp *= (twos[d]-1))%=MOD;
    (ans += tmp) %= MOD;
    tmp = 1;
    (tmp *= (twos[a]-1))%=MOD;
    (tmp *= (twos[b]-1))%=MOD;
    (tmp *= (twos[c]-1))%=MOD;
    (ans += tmp) %= MOD;
    tmp = 1;
    (tmp *= (twos[a]-1))%=MOD;
    (tmp *= (twos[c]-1))%=MOD;
    (ans += tmp) %= MOD;
    tmp = 1;
    (tmp *= (twos[b]-1))%=MOD;
    (tmp *= (twos[d]-1))%=MOD;
    (ans += tmp) %= MOD;
  }
  couts(ans);
}

int main(){
  solve();
  return 0;
}

Measured memory_bytes: 5376