// includes
#include <bits/stdc++.h>

// macros
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define bit(n) (1LL<<(n))
#define INT(n) int n; cin >> n;
#define LL(n) ll n; cin >> n;
#define DOUBLE(n) double n; cin >> n;
using namespace std;

template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}

//  types
using ll = long long int;
using P = pair<int, int>;
using Pli = pair<ll, int>;
using Pil = pair<int, ll>;
using Pll = pair<ll, ll>;
using Pdd = pair<double, double>;
using cd = complex<double>;

// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 998244353;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};

// solve
template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)(res * curr % mod);
    }
    curr = (T)(curr * curr % mod);
    tmp >>= 1;
  }

  return res;
}


template<typename T>
struct BIT_{
  int n;
  vector<T> bit;
  BIT_(){}
  BIT_(int n_){
    n = n_;
    bit = vector<T>(n+1, 0);
  }
  void add(int a, T w){
    for(int x = a; x < n; x |= (x + 1)){
      bit[x] += w;
    }
  }
  T sum(int a){
    if(a < 0)return 0;
    T res = 0;
    for(int x = a; x >= 0; x = (x & (x + 1)) - 1){
      res += bit[x];
    }
    return res;
  }
  int lower_bound(T w){
    int x = 0;
    int m = 1;
    while(m <= n)m *= 2;
    for(int k = m; k > 0; k /= 2){
      if(x + k <= n && bit[x+k-1] < w){
        w -= bit[x+k-1];
        x += k;
      }
    }
    return x;
  }
};

typedef struct BIT_<int> BITI;
typedef struct BIT_<long long> BITL;

ll calc(ll x){
  ll res = power<ll>(2, x, mod) - 1;
  if(res < 0)res += mod;
  return res;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  INT(n); vector<ll> x(n), y(n); rep(i, n)cin >> x[i] >> y[i];
  vector<ll> xc = x, yc = y; sort(all(xc)); sort(all(yc));
  map<ll, int> mpx, mpy; rep(i, n)mpx[xc[i]] = i; rep(i, n)mpy[yc[i]] = i;
  map<ll, int> mp; rep(i, n)mp[x[i]] = i;
  BITL btl(n), btr(n);
  rep(i, n)btr.add(i, 1);
  ll res = 0;
  rep(i, n){
    int at = mp[xc[i]];
    int xat = i, yat = mpy[y[at]];
    btr.add(yat, -1);

    ll rs = btr.sum(yat);
    ll ls = btl.sum(yat);
    ll tmp = power<ll>(2, n, mod);
    ll ru = n - 1 - i - rs;
    ll rd = rs;
    ll lu = i - ls;
    ll ld = ls;
    //cout << ru << " " << rd << " " << lu << " " << ld << endl;

    ll rru = calc(ru);
    ll rrd = calc(rd);
    ll rlu = calc(lu);
    ll rld = calc(ld);

    //cout << tmp << endl;
    tmp = (tmp - 1) % mod;
    //cout << tmp << endl;
    tmp = (tmp - rru) % mod;
    tmp = (tmp - rrd) % mod;
    tmp = (tmp - rlu) % mod;
    tmp = (tmp - rld) % mod;
    //cout << tmp << endl;
    tmp = (tmp - (rru * rrd) % mod) % mod;
    tmp = (tmp - (rlu * rld) % mod) % mod;
    tmp = (tmp - (rlu * rru) % mod) % mod;
    tmp = (tmp - (rld * rrd) % mod) % mod;

    btl.add(yat, 1);
    res = (res + tmp) % mod;
    if(res < 0)res += mod;
    //cout << res << endl;
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 47104