#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
//ll MOD = 1000000007;
ll MOD = 998244353;
double EPS = 1e-11;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.12lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};


//コンビネーション
const int MAXcomb = 2000010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

const int MAXkai = 200010;
ll kai_memo[MAXkai];
ll kai(ll N){
  if(kai_memo[N] != 0) return kai_memo[N];
  if(N <= 1) return 1;
  return kai_memo[N] = N * kai(N-1) % MOD;
}

ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

//Range Sum Query
const ll N_ = (1 << 18);
ll seg[2*N_-1];

void init_seg(){
  rep(i, 2*N_-1) seg[i] = 0;
}

void add(ll k, ll x){
  k += N_-1;
  seg[k] += x;
  while(k > 0){
    k = (k-1)/2;
    seg[k] = seg[2*k+1] + seg[2*k+2];
  }
}

ll get_sum(ll x, ll y, ll k = 0, ll left = 0, ll right = N_){
  if(right <= x || y <= left) return 0;
  if(x <= left && right <= y) return seg[k];
  ll mid = (left + right) / 2;
  ll l = get_sum(x, y, 2*k+1, left, mid);
  ll r = get_sum(x, y, 2*k+2, mid, right);
  return l + r;
}

ll N;
vector<pair<ll, ll>> xy;
void solve(){
  cin >> N;
  xy.resize(N);
  rep(i, N) cin >> xy[i].f >> xy[i].s;
  sort(xy.begin(), xy.end());
  vector<ll> xs, ys;
  rep(i, N){
    xs.pb(xy[i].f);
    ys.pb(xy[i].s);
  }
  sort(xs.begin(), xs.end());
  sort(ys.begin(), ys.end());
  xs.erase(unique(xs.begin(), xs.end()), xs.end());
  ys.erase(unique(ys.begin(), ys.end()), ys.end());
  rep(i, N){
    xy[i].f = lower_bound(xs.begin(), xs.end(), xy[i].f) - xs.begin();
    xy[i].s = lower_bound(ys.begin(), ys.end(), xy[i].s) - ys.begin();
  }

  vector<ll> lu(N), ld(N), ru(N), rd(N);
  rep(i, N){
    ld[i] = get_sum(0, xy[i].s);
    lu[i] = get_sum(xy[i].s+1, N_);
    add(xy[i].s, 1);
  }
  init_seg();
  revrep(i, N){
    rd[i] = get_sum(0, xy[i].s);
    ru[i] = get_sum(xy[i].s+1, N_);
    add(xy[i].s, 1);
  }

  ll ans = 0;
  rep(i, N){
    ans += pow_mod(2, N-1);
    ans %= MOD;
    ll ulu = pow_mod(2, lu[i]) - 1;
    ll uld = pow_mod(2, ld[i]) - 1;
    ll uru = pow_mod(2, ru[i]) - 1;
    ll urd = pow_mod(2, rd[i]) - 1;

    //四つ
    ans += ulu * uld % MOD * uru % MOD * urd % MOD;
    ans %= MOD;
    
    //三つ
    ans += ulu * uld % MOD * uru % MOD;
    ans %= MOD;
    ans += ulu * uld % MOD * urd % MOD;
    ans %= MOD;
    ans += ulu * uru % MOD * urd % MOD;
    ans %= MOD;
    ans += uld * uru % MOD * urd % MOD;
    ans %= MOD;

    //二つ
    ans += ulu * urd % MOD;
    ans %= MOD;
    ans += uld * uru % MOD;
    ans %= MOD;
  }
  cout << ans << endl;
}


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 19172