#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
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; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 998244353;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

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;
  }
};

template< typename T >
T mod_pow(T x, T n, const T &p) {
  T ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= p;
    (x *= x) %= p;
    n >>= 1;
  }
  return ret;
}


int main(){
    iosetup;
    ll N; cin >> N;
    vector<pii> P(N);
    vector<int> COM(N);
    map<int, int> F;
    rep(i, 0, N){
        int x, y; cin >> x >> y;
        P[i] = {x, y};
        COM[i] = y;
    }
    sort(ALL(COM));
    rep(i, 0, N) F[COM[i]] = i;
    rep(i, 0, N) P[i].second = F[P[i].second];
    sort(ALL(P));
    // rep(i, 0, N){
    //   cerr << i << " " << P[i].second << endl;
    // }
    modint ans = 0;
    BinaryIndexedTree<int> bit(N), rbit(N);
    vector<ll> dpd(N),dpu(N),rdpd(N), rdpu(N);
    rep(i, 0, N){
        dpd[i] = bit.sum(P[i].second);
        dpu[i] = i - dpd[i];
        bit.add(P[i].second, 1);
    }
    rrep(i, 0, N){
        rdpd[i] = rbit.sum(P[i].second);
        rdpu[i] = N - 1 - i - rdpd[i];
        rbit.add(P[i].second, 1);
    }
    ans = mod_pow<ll>(2, N - 1, mod) * N;
    rep(i, 0, N){
        ans += (mod_pow<ll>(2, dpd[i], mod) - 1) * (mod_pow<ll>(2, rdpu[i], mod) - 1) % mod
         * (mod_pow<ll>(2, dpu[i], mod) + mod_pow<ll>(2, rdpd[i], mod) - 1);
        //cerr << ans << " ";
        ans += (mod_pow<ll>(2, dpu[i], mod) - 1) * (mod_pow<ll>(2, rdpd[i], mod) - 1) % mod 
        * (mod_pow<ll>(2, dpd[i] , mod) + mod_pow<ll>(2, rdpu[i] , mod) - 1);
        ans += (mod_pow<ll>(2, dpu[i], mod) - 1) * (mod_pow<ll>(2, rdpd[i], mod) - 1) % mod
        * (mod_pow<ll>(2, dpd[i], mod) - 1) % mod * (mod_pow<ll>(2, rdpu[i], mod) - 1) % mod;
        //cerr << ans << endl;
    }
    
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 19840