//{{{
#include<algorithm>
#include<cmath>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<random>
#include<set>
#include<sstream>
#include<sys/time.h>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include"rprint2.hpp"
#else
#define FUNC(name) template <ostream& out = cout, class... T> void name(T&&...){ }
FUNC(printde) FUNC(printdbe) FUNC(printdwe) FUNC(printdu);
#endif
template <template <class T, class = std::allocator<T>> class V, class E>
istream& operator >> (istream& in, V<E>& v){ for(auto& e : v){ in >> e; } return in; }
//}}}

template <int M>
struct ModInt {
    int num;
    ModInt(): num(0){ }
    ModInt(int num): num(num){ }
    operator int () const { return num; }
    // template <class T> ModInt operator + (T n) const { n += num; return n >= M ? n - M : n; }
    // template <class T> ModInt operator - (T n) const { n = num - n; return n < 0 ? n + M : n; }
    template <class T> ModInt operator + (T n) const { auto ret = num + n; return ret >= M ? ret - M : ret; }
    template <class T> ModInt operator - (T n) const { auto ret = num - n; return ret < 0 ? ret + M : ret; }
    // template <class T> ModInt operator + (T n) const { return (num + n) % M; }
    // template <class T> ModInt operator - (T n) const { return (num - n + M) % M; }
    template <class T> ModInt operator * (T n) const { return (ll)num * n % M; }
    template <class T> ModInt operator / (T n) const { return (ll)num * modInv(ModInt(n)) % M; }
    template <class T> ModInt operator >> (T n) const { return num >> n; }
    template <class T> ModInt operator << (T n) const { return ((ll)num << n) % M; }
    template <class T> ModInt operator | (T n) const { return num | n; }
    template <class T> ModInt operator & (T n) const { return num & n; }
    template <class T> bool operator < (T n) const { return num < n; }
    template <class T> bool operator > (T n) const { return num > n; }
    template <class T> bool operator <= (T n) const { return num <= n; }
    template <class T> bool operator >= (T n) const { return num >= n; }
    template <class T> bool operator == (T n) const { return num == n; }
    template <class T> bool operator != (T n) const { return num != n; }
    ModInt operator ++ (int){ int ret = num; num = num == M + 1 ? 0 : num + 1; return ret; }
    ModInt operator -- (int){ int ret = num; num = num == 0 ? M - 1 : num - 1; return ret; }
    ModInt operator ++ (){ return num = num == M + 1 ? 0 : num + 1; }
    ModInt operator -- (){ return num = num == 0 ? M - 1 : num - 1; }
    // ModInt operator ++ (int){ int ret = num; num = (num + 1) % M; return ret; }
    // ModInt operator -- (int){ int ret = num; num = (num - 1 + M) % M; return ret; }
    // ModInt operator ++ (){ return num = (num + 1) % M; }
    // ModInt operator -- (){ return num = (num - 1 + M) % M; }
    template <class T> ModInt operator += (T n){ num += n; return num = num >= M ? num - M : num; }
    template <class T> ModInt operator -= (T n){ num -= n; return num = num < 0 ? num + M : num; }
    // template <class T> ModInt operator += (T n){ auto ret = num + n; return num = ret >= M ? ret - M : ret; }
    // template <class T> ModInt operator -= (T n){ auto ret = num - n; return num = ret < 0 ? ret + M : ret; }
    // template <class T> ModInt operator += (T n){ return num = (num + n) % M; }
    // template <class T> ModInt operator -= (T n){ return num = (num - n) % M; }
    template <class T> ModInt operator *= (T n){ return num = (ll)num * n % M; }
    template <class T> ModInt operator /= (T n){ return num = (ll)num * modInv(n) % M; }
    template <class T> ModInt operator >>= (T n){ return num = num >> n; }
    template <class T> ModInt operator <<= (T n){ return num = ((ll)num << n) % M; }
    friend ModInt modPow(ModInt base, ModInt ex);
    static vector<ModInt> mFacts, mInvFacts;
    friend ModInt modFact(ModInt n){ return mFacts[n.num]; }
    friend ModInt modInvFact(ModInt n){ return mInvFacts[n.num]; }
    friend ModInt modInv(ModInt n){ return modPow(n, M - 2); }
    friend ModInt modC(ModInt n, ModInt k){ return modFact(n) * modInvFact(k) * modInvFact(n - k); }
    static void init(int n){
        mFacts.resize(n + 1);
        mInvFacts.resize(n + 1);
        mFacts[0] = 1;
        for(int i = 1; i <= n; i++){
            mFacts[i] = mFacts[i - 1] * i;
        }
        mInvFacts[n] = modInv(mFacts[n]);
        for(int i = n - 1; i >= 0; i--){
            mInvFacts[i] = mInvFacts[i + 1] * (i + 1);
        }
    }
    friend istream& operator >> (istream& in, ModInt& e){ return in >> e.num; }
    friend ostream& operator << (ostream& out, const ModInt& e) { return out << e.num; }
};
template <int M>
vector<ModInt<M>> ModInt<M>::mFacts;
template <int M>
vector<ModInt<M>> ModInt<M>::mInvFacts;
using mint = ModInt<998244353>;
// using mint = ModInt<(int)M>;
mint modPow(mint base, mint ex){
    mint ret = 1;
    while(ex.num){
        if(ex.num & 1){ ret = ret * base; }
        ex >>= 1;
        base = base * base;
    }
    return ret;
}
    // mint::init(1e6);

struct BIT0{
    vector<int> data;
    BIT0(int n): data(n + 1){ }
    void add(int idx, int num){
        // idx = max(0, min((int)data.size() - 1, idx));
        idx++;
        for(; idx < (int)data.size(); idx += idx & -idx){
            data[idx] += num;
        }
    }
    int sum(int idx){
        // idx = max(0, min((int)data.size() - 1, idx));
        idx++;
        int ret = 0;
        for(; idx; idx -= idx & -idx){
            ret += data[idx];
        }
        return ret;
    }
};

int main(){
    cin.tie(0); ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> xs(n), ys(n);
    for(int i = 0; i < n; i++){
        cin >> xs[i] >> ys[i];
    }

    vector<int> xidx(n), yidx(n);
    iota(xidx.begin(), xidx.end(), 0);
    sort(xidx.begin(), xidx.end(), [&](int i, int j){ return xs[i] < xs[j]; });
    iota(yidx.begin(), yidx.end(), 0);
    sort(yidx.begin(), yidx.end(), [&](int i, int j){ return ys[i] < ys[j]; });
    for(int i = 0; i < n; i++){
        ys[yidx[i]] = i;
    }

    vector<int> ul(n), ur(n), dr(n), dl(n);
    {
        BIT0 bt(n);
        int cnt = 0;
        for(auto& xi : xidx){
            dl[xi] = bt.sum(ys[xi]);
            ul[xi] = cnt - dl[xi];
            bt.add(ys[xi], 1);
            cnt++;
        }
    }
    reverse(xidx.begin(), xidx.end());
    {
        BIT0 bt(n);
        int cnt = 0;
        for(auto& xi : xidx){
            dr[xi] = bt.sum(ys[xi]);
            ur[xi] = cnt - dr[xi];
            bt.add(ys[xi], 1);
            cnt++;
        }
    }

    mint ans = 0;
    mint total = modPow(2, n) - 1;
    for(int i = 0; i < n; i++){
        ans += total;
        ans -= modPow(2, ul[i] + ur[i]) - 1;
        ans -= modPow(2, ur[i] + dr[i]) - 1;
        ans -= modPow(2, dr[i] + dl[i]) - 1;
        ans -= modPow(2, dl[i] + ul[i]) - 1;
        ans += modPow(2, ul[i]) - 1;
        ans += modPow(2, ur[i]) - 1;
        ans += modPow(2, dr[i]) - 1;
        ans += modPow(2, dl[i]) - 1;
    }
    cout << ans << '\n';
}
/*
100
u: 30
r: 31
d: 32
l: 31
ul = x
ur = 30 - x
dr = 31 - (30 - x) = 1 + x
dl = 32 - (1 + x) = 31 - x
ul = 31 - (31 - x) = x
*/


Measured memory_bytes: 9328