#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 998244353;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
bool dbg = false;

template <typename T>
struct Compress {
    vector<T> xs;

    Compress() = default;

    Compress(const vector<T>& vs) {
        add(vs);
    }

    Compress(const initializer_list<vector<T>>& vs) {
        for (auto& p : vs)
            add(p);
    }

    void add(const vector<T>& vs) {
        copy(begin(vs), end(vs), back_inserter(xs));
    }

    void add(const T& x) {
        xs.emplace_back(x);
    }

    void build() {
        sort(begin(xs), end(xs));
        xs.erase(unique(begin(xs), end(xs)), end(xs));
    }

    vector<int> get(const vector<T>& vs) const {
        vector<int> ret;
        transform(begin(vs), end(vs), back_inserter(ret), [&](const T& x) {
            return lower_bound(begin(xs), end(xs), x) - begin(xs);
        });
        return ret;
    }

    int get(const T& x) const {
        return lower_bound(begin(xs), end(xs), x) - begin(xs);
    }

    const T& operator[](int k) const {
        return xs[k];
    }
};
//SegmentTree
//How to use
//SegmentTree(n, f, M1):= サイズ n の初期化。ここで f は2つの区間の要素をマージする二項演算, M1はモノイドの単位元である。
//set(k , x):= k 番目の要素に x を代入する。
//build():= セグメント木を構築する。
//query(a , b):= 区間 [a,b) に対して二項演算した結果を返す。
//update(k , x):= k 番目の要素を x に変更する。
//operator[k] : = k 番目の要素を返す。
template <typename Monoid>
struct SegmentTree {
    using F = function<Monoid(Monoid, Monoid)>;

    int sz;
    vector<Monoid> seg;

    const F f;
    const Monoid M1;

    SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {
        sz = 1;
        while (sz < n)
            sz <<= 1;
        seg.assign(2 * sz, M1);
    }

    void set(int k, const Monoid& x) {
        seg[k + sz] = x;
    }

    void build() {
        for (int k = sz - 1; k > 0; k--) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }

    void update(int k, const Monoid& x) {
        k += sz;
        seg[k] = x;
        while (k >>= 1) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }

    Monoid query(int a, int b) {
        Monoid L = M1, R = M1;
        for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if (a & 1)
                L = f(L, seg[a++]);
            if (b & 1)
                R = f(seg[--b], R);
        }
        return f(L, R);
    }

    Monoid operator[](const int& k) const {
        return seg[k + sz];
    }
};
//example
/*
int main() {
  int N, Q;
  scanf("%d %d", &N, &Q);
  SegmentTree< int > seg(N, [](int a, int b) { return min(a, b); }, INT_MAX);
  while(Q--) {
    int T, X, Y;
    scanf("%d %d %d", &T, &X, &Y);
    if(T == 0) seg.update(X, Y);
    else printf("%d\n", seg.query(X, Y + 1));
  }
}
*/

template <uint MD>
struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(_v % MD + MD); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(ull(v) * r.v % MD); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1)
                r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<MOD>;

int N;
struct P {
    int x, y;
};

vector<P> V;
int A[202020], B[202020], C[202020], D[202020];

void solve() {
    Mint ans = 0;
    Compress<int> CX, CY;
    FOR(N) {
        CX.add(V[i].x);
        CY.add(V[i].y);
    }
    CX.build();
    CY.build();
    FOR(N) {
        V[i].x = CX.get(V[i].x);
        V[i].y = CY.get(V[i].y);
        //cerr << i << " " << V[i].x << " " << V[i].y << endl;
    }
    sort(all(V), [](P a, P b) { return a.x < b.x; });
    SegmentTree<int> seg(N, [](itn a, int b) { return a + b; }, 0);
    seg.build();
    FOR(x, N) {
        A[x] = seg.query(0, V[x].y);
        B[x] = x - A[x];
        seg.update(V[x].y, 1);
    }
    FOR(x, N) {
        seg.update(x, 0);
    }
    for (int x = N - 1; x >= 0; x--) {
        C[x] = seg.query(0, V[x].y);
        D[x] = seg.query(V[x].y, N);
        seg.update(V[x].y, 1);
    }
    FOR(N) {
        int a = A[i], b = B[i], c = C[i], d = D[i];
        //cerr << a << " " << b << " " << c << " " << d << endl;
        Mint tmp = 0;
        Mint two = 2;
        Mint aa = two.pow(a);
        Mint bb = two.pow(b);
        Mint cc = two.pow(c);
        Mint dd = two.pow(d);
        tmp += (aa - 1) * (bb - 1) * (cc - 1) * dd;
        tmp += (bb - 1) * (cc - 1) * dd;
        tmp += (aa - 1) * (dd - 1) * bb;
        tmp += (aa - 1) * (dd - 1) * (cc - 1);
        tmp += two.pow(N - 1);
        ans += tmp;
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N;
    V.resize(N);
    FOR(N) {
        itn x, y;
        cin >> x >> y;
        V[i].x = x;
        V[i].y = y;
    }


    solve();
    return 0;
}


Measured memory_bytes: 17124