#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
int mod = 998244353;
// int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T1, typename T2> T1 pow_(T1 a, T2 b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  int T;
  T = 1;
  while (T--) solve();
}

// 10^5 * 10^5 になるから 2 次元 BIT は無理
// 右上, 右下, 左上, 左下の個数が欲しい
// 左は, x 昇順でわかる

struct BIT { // 0 indexed
  int n;
  vector<ll> bit;
  BIT(int n) : n(n) { bit.resize(n); }
  BIT(vector<ll> v) {
    n = sz(v);
    bit.resize(n);
    rep(i, n) add(i, v[i]);
  }
  void add(int a, ll w) { for (int x = a; x < n; x |= x + 1) bit[x] += w; }
  ll sum(int a) { // [0, a)
    ll ret = 0;
    for (int x = a - 1; x >= 0; x = (x & (x + 1)) - 1) ret += bit[x];
    return ret;
  }
  ll sum(int a, int b) { return sum(b) - sum(a); } // [a, b)
};

void solve() {
  int n;
  cin >> n;
  vector<int> x(n), y(n);
  rep(i, n) cin >> x[i] >> y[i];
  vector<int> x2 = x, y2 = y;
  sort(all(x2));
  sort(all(y2));

  ll ans = 0;
  // 上, 下, 左, 右各々だけの集合の個数
  // 左上, 左下, 右上, 右下だけの集合の個数が重複
  rep(i, n) {
    vector<int> v(4);
    int it = lb(x2, x[i]), it2 = lb(y2, y[i]);
    v[0] = it;
    v[1] = it2;
    rep(j, 2) v[2 + j] = n - 1 - v[j];
    rep(j, 4) (ans += modpow(2, v[j], mod)) %= mod;
    // cerr << i << " " << ans << endl;
  }
  // x 昇順, 左がわかる
  vector<pii> v(n);
  rep(i, n) v[i] = pii(x[i], y[i]);
  sort(all(v));

  rep(_, 2) {
    BIT bit(n); // y 
    rep(i, n) {
      int it = lb(y2, v[i].S);
      int tmp = bit.sum(it);
      (ans += mod - modpow(2, tmp, mod)) %= mod; // 1 周目は左下, 2 周目は右下
      (ans += mod - modpow(2, i - tmp, mod)) %= mod; // debuged
      bit.add(it, 1);
    }
    reverse(all(v));
  }
  cout << (n * (modpow(2, n, mod) + mod - 1) - ans + mod) % mod << endl;
}


Measured memory_bytes: 6528