#include<bits/stdc++.h>
//using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key)))
#define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//#define endl "\n"
using std::endl;
using std::cin;
using std::cout;
using std::vector;
using std::string;
using std::upper_bound;
using std::lower_bound;
using vi=vector<ll>;
using vii=vector<vi>;
using pii=std::pair<ll,ll>;
//constexpr ll MOD=1e9+7;
constexpr ll MOD=998244353;
//constexpr ll MOD=10000000;
constexpr ll MAX=1e7;
constexpr ll INF=(1ll<<60);
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
struct Binary_indexed_tree{
    int N;
    vi bit;
    Binary_indexed_tree(int n):N(n){
        bit.resize(N+1,0);
    }
    void add(int x,int a){
        for(x;x<=N;x+=(x&-x)) bit[x]+=a;
    }
    ll sum(int x){
        ll ret=0;
        for(x;x>0;x-=(x&-x)) ret+=bit[x];
        return ret;
    }
    ll lower_bound(ll X){
        if(sum(N)<X) return -1;
        ll ret=0,memo=1,sum=0;
        while(memo*2<=N) memo*=2;
        while(memo>0){
            if(memo+ret<=N&&sum+bit[memo+ret]<X){
                sum+=bit[memo+ret];
                ret+=memo;
            }
            memo/=2;
        }
        return ret+1;
    }
};
struct Union_Find{
    ll N;
    vi par;
    vi siz;
    Union_Find(int n):N(n){
        par.resize(N);
        siz.resize(N,1);
        rep(i,0,N) par[i]=i;
    }
    ll root(ll X){
        if(par[X]==X) return X;
        return par[X]=root(par[X]);
    }
    bool same(ll X,ll Y){
        return root(X)==root(Y);
    }
    void unite(ll X,ll Y){
        X=root(X);
        Y=root(Y);
        if(X==Y) return;
        par[X]=Y;
        siz[Y]+=siz[X];
        siz[X]=0;
    }
    ll size(ll X){
        return siz[root(X)];
    }
};
ll modpow(ll X,ll Y,ll mod){
    ll sum=X,cnt=1;
    vi A;
    while(cnt<=Y){
        A.pb(sum);
        sum*=sum;
        sum%=mod;
        cnt*=2;
    }
    int M=A.size();
    ll ret=1;
    REP(i,1,M){
        if(Y>=(1ll<<M-i)){
            Y-=(1ll<<M-i);
            ret*=A[M-i];
            ret%=mod;
        }
    }
    return ret;
}
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
ll COM(ll n,ll r){
    if(n<r||n<0||r<0) return 0;
    return fac[n]*finv[r]%MOD*finv[n-r]%MOD;
}
template <typename T>
struct BIT2D {
    int H, W;
    vector<vector<T>> bit;  // データの格納先
    BIT2D(int H_, int W_) { init(H_, W_); }
    void init(int H_, int W_) {
        H = H_ + 1;
        W = W_ + 1;
        bit.assign(H, vector<T>(W, 0));
    }
 
    void add(int h, int w, T x) {
        for (int i = h; i < H; i += (i & -i)) {
            for (int j = w; j < W; j += (j & -j)) {
                bit[i][j] += x;
            }
        }
    }
    // 1≦i≦h かつ 1≦j≦w
    T sum(int h, int w) {
        T s(0);
        for (int i = h; i > 0; i -= (i & -i)) {
            for (int j = w; j > 0; j -= (j & -j)) {
                s += bit[i][j];
            }
        }
        return s;
    }
 
    // h1≦i<h2 かつ w1≦j<w2
    T query(int h1, int w1, int h2, int w2) {
        return sum(h2, w2) - sum(h2, w1 - 1) - sum(h1 - 1, w2) + sum(h1 - 1, w1 - 1);
    }
};
signed main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N; cin>>N;
    std::map<int,int> x,y;
    std::set<int> p,q;
    vi A(N),B(N);
    rep(i,0,N){
        cin>>A[i]>>B[i];
        p.insert(A[i]);
        q.insert(B[i]);
    }
    ll X=p.size()+1,Y=q.size()+1;
    int cnt=0;
    for(auto a:p) x[a]=++cnt;
    cnt=0;
    for(auto a:q) y[a]=++cnt;
    Binary_indexed_tree BIT(Y);
    vii m(X+1);
    rep(i,0,N){
        m[x[A[i]]].pb(y[B[i]]);
    }
    ll ans=0;
    vii memo(N,vi(9));
    cnt=0;
    REP(i,0,X){
        ll q=cnt;
        rep(j,0,m[i].size()){
            ll p=m[i][j];
            memo[q][0]=BIT.sum(p-1);
            memo[q][3]=BIT.sum(p)-memo[q][0];
            memo[q][6]=BIT.sum(Y)-memo[q][0]-memo[q][3];
            q++;
        }
        rep(j,0,m[i].size()){
            ll p=m[i][j];
            BIT.add(p,1);
        }
        rep(j,0,m[i].size()){
            ll p=m[i][j];
            memo[cnt][1]=BIT.sum(p-1)-memo[cnt][0];
            memo[cnt][4]=BIT.sum(p)-memo[cnt][0]-memo[cnt][1]-memo[cnt][3];
            memo[cnt][7]=BIT.sum(Y)-memo[cnt][0]-memo[cnt][3]-memo[cnt][1]-memo[cnt][4]-memo[cnt][6];
            cnt++;
        }
    }
    cnt=0;
    REP(i,0,X){
        rep(j,0,m[i].size()){
            ll p=m[i][j];
            memo[cnt][2]=BIT.sum(p-1)-memo[cnt][0]-memo[cnt][1];
            memo[cnt][5]=BIT.sum(p)-memo[cnt][0]-memo[cnt][1]-memo[cnt][3]-memo[cnt][2]-memo[cnt][4];
            memo[cnt][8]=BIT.sum(Y)-memo[cnt][0]-memo[cnt][3]-memo[cnt][1]-memo[cnt][4]-memo[cnt][6]-memo[cnt][2]-memo[cnt][5]-memo[cnt][7];
            cnt++;
        }
    }
    rep(i,0,N){
        ans+=modpow(2,N,MOD)-1;
        vi P=memo[i];
        ans-=modpow(2,P[0]+P[3]+P[6],MOD)-1;
        ans-=modpow(2,P[2]+P[5]+P[8],MOD)-1;
        ans-=modpow(2,P[0]+P[1]+P[2],MOD)-1;
        ans+=modpow(2,P[0],MOD)-1;
        ans+=modpow(2,P[2],MOD)-1;
        ans-=modpow(2,P[6]+P[7]+P[8],MOD)-1;
        ans+=modpow(2,P[6],MOD)-1;
        ans+=modpow(2,P[8],MOD)-1;
        ans%=MOD;
        if(ans<0) ans+=MOD;
    }
    cout<<ans<<endl;
}


Measured memory_bytes: 74284