#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX //1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX //1e9
#define MAX_LL LLONG_MAX //1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX //1e19
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef pair<ll,ll> PLL;
typedef pair<char,int> PCI;
typedef pair<int,char> PIC;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL; 
typedef pair<ll,char> PLC; 
typedef pair<char,ll> PCL; 

inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}

template<int MOD> struct Fp {
    ll val;
    constexpr Fp(ll v = 0) noexcept : val(v % MOD) {
        if (val < 0) v += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};


const int MOD = 998244353;
//const int MOD = 1e6 + 3;
//const int MOD = 1e9 + 7;
const int N_MAX = 2e5+5;
//mint:mod演算のための型
using mint = Fp<MOD>;
//型変換
#define MINT (mint)

//mod MOD上での階乗
mint fact[N_MAX];
void init(){
  fact[0] = fact[1] = MINT 1;
  for(int i = 2; i < N_MAX; i++){
    fact[i] = fact[i-1] * i;
  }
}

//mod MOD上での逆元
inline mint inv(mint n){
  return modpow(n,MOD-2);
}

//二項係数の計算(mod MOD上)
inline mint COM(int n, int k){
  if(n<k) return 0;
  return fact[n]/(fact[k]*fact[n-k]);
}

mint pow_2[N_MAX];

void po_2(int x){
  pow_2[0] = 1;
  rep(i,x)pow_2[i+1] = pow_2[i]*2;
}

template< typename T >
struct BinaryIndexedTree {
  vector< T > data;

  BinaryIndexedTree(int sz) {
    data.assign(++sz, 0);
  }

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

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

const mint m1 = 1;

int main(void){
  SPEEDUP
  cout << setprecision(15);
  int N;cin >> N;
  po_2(N);
  vector<PII> v(N);
  vector<int> xv(N);
  vector<int> yv(N);
  rep(i,N){
    cin >> v[i].first >> v[i].second;
    xv[i] = v[i].first;
    yv[i] = v[i].second;
  }
  sort(all(xv));
  sort(all(yv));

  //座圧処理
  int n;
  {
    int x = 0,y = 0;
    map<int,int> xmp, ymp;
    rep(i,N){
      if(!xmp.count(xv[i])) xmp[xv[i]] = x++;
      if(!ymp.count(yv[i])) ymp[yv[i]] = y++;
    }
    rep(i,N){
      v[i].first = xmp[v[i].first];
      v[i].second = ymp[v[i].second];
    }
    n = y;
  }

  sort(all(v));
  BinaryIndexedTree<int> smallbit(n);
  BinaryIndexedTree<int> bigbit(n);
  rep(i,N) bigbit.add(v[i].second,1);
  mint ans = 0;
  rep(i,N){
    bigbit.add(v[i].second,-1);
    int xu_yu = bigbit.sum(n-1) - bigbit.sum(v[i].second);
    int xu_yl = bigbit.sum(v[i].second);
    int xl_yu = smallbit.sum(n-1) - smallbit.sum(v[i].second);
    int xl_yl = smallbit.sum(v[i].second);
    ans += pow_2[N-1];
    ans += MINT (pow_2[xu_yu] + pow_2[xl_yl] -m1) * (pow_2[xu_yl] -m1) * (pow_2[xl_yu] -m1);
    ans += MINT (pow_2[xu_yl] + pow_2[xl_yu] -m1) * (pow_2[xu_yu] -m1) * (pow_2[xl_yl] -m1);
    ans += MINT (pow_2[xu_yl] -m1) * (pow_2[xl_yu] -m1) * (pow_2[xu_yu] -m1) * (pow_2[xl_yl] -m1);
    smallbit.add(v[i].second,1);
  }
  cout << ans << endl;
  return 0;
} 


Measured memory_bytes: 23680