#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 998244353;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
template <typename T> struct BIT {
  vector<T> data;

  BIT(ll sz) { data.assign(++sz, 0); }

  T sum(ll k) {
    T ret = 0;
    for (++k; k > 0; k -= k & -k)
      ret += data[k];
    return (ret);
  }

  void add(ll k, T x) {
    for (++k; k < data.size(); k += k & -k)
      data[k] += x;
  }
};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl X(N), Y(N);
  vector<pll> vec(N);
  vvl num = VVL(200010, 4, 0);
  vl p2(200010, 0);

  p2[0] = 1;
  FOR(i, 1, 200010) p2[i] = (p2[i - 1] * 2) % MOD;

  REP(i, N) {
    cin >> X[i] >> Y[i];
    vec[i] = make_pair(X[i], Y[i]);
  }
  sort(ALL(X));
  sort(ALL(Y));
  // 座圧してる
  REP(i, N) {
    ll x = vec[i].first;
    ll y = vec[i].second;
    x = lower_bound(ALL(X), x) - X.begin();
    y = lower_bound(ALL(Y), y) - Y.begin();
    vec[i] = make_pair(x, y);
  }
  sort(ALL(vec)); // x座標基準でソートされる

  REP(t, 2) {
    BIT<ll> T(200010);
    REP(i, N) {
      ll a = T.sum(vec[i].second - 1);
      ll b = i - T.sum(vec[i].second);
      if (t == 0) {
        num[i][0] = a; //点iよりx座標が小さく、y座標も小さい
        num[i][1] = b; //点iよりx座標が小さく、y座標が大きい
      } else {
        num[N - 1 - i][2] = a; //点iよりx座標が大きく、y座標は小さい
        num[N - 1 - i][3] = b; //点iよりx座標が大きく、y座標も大きい
      }
      T.add(vec[i].second, 1);
    }
    reverse(ALL(vec));
  }

  ll ans = 0;
  REP(i, N) {
    ll a = (p2[num[i][0]] + p2[num[i][3]] - 1) % MOD;
    ll b = (p2[num[i][1]] + p2[num[i][2]] - 1) % MOD;

    ll v = (p2[N] - a * b) % MOD;
    if (v < 0)
      v += MOD;
    ans = (ans + v) % MOD;
  }
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 23680