#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;

constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;

template <typename T> constexpr bool chmax(T &a, const T b) {
    if(a >= b) return false;
    a = b;
    return true;
}
template <typename T> constexpr bool chmin(T &a, const T b) {
    if(a <= b) return false;
    a = b;
    return true;
}

/*-------------------------------------------*/

template <int M> class ModInt {
    int x;

  public:
    constexpr ModInt() : x(0) {}
    constexpr ModInt(int64_t y) : x(y >= 0 ? y % M : (M - (-y) % M) % M) {}
    constexpr ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= M) x -= M;
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt &p) {
        if((x += M - p.x) >= M) x -= M;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % M);
        return *this;
    }
    constexpr ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
    constexpr ModInt operator-() const { return ModInt(-x); }
    constexpr ModInt operator+(const ModInt &p) const {
        return ModInt(*this) += p;
    }
    constexpr ModInt operator-(const ModInt &p) const {
        return ModInt(*this) -= p;
    }
    constexpr ModInt operator*(const ModInt &p) const {
        return ModInt(*this) *= p;
    }
    constexpr ModInt operator/(const ModInt &p) const {
        return ModInt(*this) /= p;
    }
    constexpr bool operator==(const ModInt &p) const { return x == p.x; }
    constexpr bool operator!=(const ModInt &p) const { return x != p.x; }
    constexpr ModInt inverse() const {
        int a = x, b = M, u = 1, v = 0, t = 0;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    constexpr ModInt pow(const int64_t &n) const {
        ModInt ret(1), mul(x);
        int64_t k = n % (M - 1);
        while(k > 0) {
            if(k & 1) ret *= mul;
            mul *= mul;
            k >>= 1;
        }
        return ret;
    }
    constexpr friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }
    constexpr friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t = 0;
        is >> t;
        a = ModInt(t);
        return (is);
    }
};
using modint = ModInt<Mod>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    int N;
    cin >> N;
    vector<int> X(N), Y(N), xp(N), yp(N);
    rep(i, N) {
        cin >> X[i] >> Y[i];
        xp[i] = yp[i] = i;
    }
    sort(ALL(xp), [&](int i, int j) { return X[i] < X[j]; });
    sort(ALL(yp), [&](int i, int j) { return Y[i] < Y[j]; });
    rep(i, N) {
        X[xp[i]] = i;
        Y[yp[i]] = i;
    }
    vector<modint> pw2(N, 1);
    FOR(i, 1, N) pw2[i] = pw2[i - 1] * 2;
    vector<int> bit(N + 1);
    modint ans = pw2[N - 1] * N;
    for(int i : xp) {
        ans += pw2[N - 1] - 1;
        ans -= pw2[X[i]] + pw2[Y[i]] + pw2[N - X[i] - 1] + pw2[N - Y[i] - 1];
        int pa = 0;
        for(int j = Y[i]; j > 0; j -= j & -j) {
            pa += bit[j];
        }
        for(int j = Y[i] + 1; j <= N; j += j & -j)
            bit[j]++;
        int pb = X[i] - pa;
        int pc = Y[i] - pa;
        int pd = N - 1 - pa - pb - pc;
        ans += pw2[pa] + pw2[pb] + pw2[pc] + pw2[pd];
    }
    cout << ans << endl;

    return 0;
}

Measured memory_bytes: 4992