#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
struct BIT{
    vector<int> bit;
    int size;
    BIT(int n):size(n), bit(n+1, 0){}
    int sum(int i){
        int s=0;
        while(i>0){
            s+=bit[i];
            i-=(i&(-i));
        }
        return s;
    }
    void add(int i, int x){
        while(i<=size){
            bit[i]+=x;
            i+=(i&(-i));
        }
    }
};
int main()
{
    int n; cin>>n;
    int x[200020], y[200020], xs[200020], ys[200020];
    for(int i=0; i<n; i++){
        cin>>x[i]>>y[i];
        xs[i]=x[i];
        ys[i]=y[i];
    }
    sort(xs, xs+n);
    sort(ys, ys+n);
    P p[200020];
    for(int i=0; i<n; i++){
        x[i]=lower_bound(xs, xs+n, x[i])-xs;
        y[i]=lower_bound(ys, ys+n, y[i])-ys;
        p[i]=P(x[i], y[i]);
    }
    sort(p, p+n);
    ll p2[200020];
    p2[0]=1;
    for(int i=1; i<=n; i++) p2[i]=p2[i-1]*2%MOD;
    BIT b(n);
    ll ans=0;
    for(int i=0; i<n; i++){
        int y0=p[i].second+1;
        int m=b.sum(y0-1);
        b.add(y0, 1);
        ans+=(p2[n]-p2[n-y0]-p2[y0-1]-p2[i]-p2[n-1-i]+p2[m]+p2[y0-1-m]+p2[i-m]+p2[n-y0-i+m]-1+5*MOD);
        ans%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}