#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 1987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

struct NODE{
    NODE(): v(0), left(0), right(0) {}
    int v;
    NODE *left, *right;
} *Tree[200001];

NODE *make_tree(NODE *now, int s, int e, int y, int v)
{
    if (y < s || e < y) return now;
    NODE *ret = new NODE();
    if (s == e){
        ret->v = now->v + v;
        return ret;
    }
    int m = (s+e) >> 1;
    ret->left = make_tree(now->left, s, m, y, v);
    ret->right = make_tree(now->right, m+1, e, y, v);
    ret->v = (ret->left ? ret->left->v : 0) + (ret->right ? ret->right->v : 0);
    return ret;
}

void init(NODE *now,int s,int e)
{
	if(s==e)return;
	now->left=new NODE;
	now->right=new NODE;
	init(now->left,s,(s+e)/2);
	init(now->right,(s+e)/2+1,e);
}

int find(NODE *now, int S, int E, int i, int j)
{
	if (i > E || j < S)return 0;
	if (i <= S && j >= E)return now->v;
	int ret=0;
	if(now->left)ret+=find(now->left,S,(S+E)/2,i,j);
	if(now->right)ret+=find(now->right,(S+E)/2+1,E,i,j);
	return ret;
}
Vi vv;
Pi p[200001];
int pow2[200001];
inline int c(int x)
{
	return pow2[x]-1;
}
int main() {
	int n;
	scanf("%d",&n);
	pow2[0]=1;
	fup(i,1,200000,1)pow2[i]=(pow2[i-1]<<1)%MOD;
	ll ans=pow2[n]-1;
	ans=(ans*n)%MOD;
	fup(i,1,n,1)
	{
		scanf("%d%d",&p[i].X,&p[i].Y);
		vv.pb(p[i].Y);
	}
	sort(ALL(vv));
	vv.resize(unique(ALL(vv))-vv.begin());
	fup(i,1,n,1)p[i].Y=lower_bound(ALL(vv),p[i].Y)-vv.begin();
	sort(p+1,p+n+1);
	int N=vv.size();
	Tree[0]=new NODE;
	init(Tree[0],0,n-1);
	fup(i,1,n,1)
	{
		Tree[i] = make_tree(Tree[i-1], 0, N-1, p[i].Y, 1);
	}
	fup(i,1,n,1)
	{
		int lx=lower_bound(p+1,p+n+1,mp(p[i].X,-1))-p-1;
		int rx=upper_bound(p+1,p+n+1,mp(p[i].X,INF))-p;
		int t=find(Tree[n],0,N-1,p[i].Y+1,n);
		ans-=c(t);
		t=find(Tree[n],0,N-1,0,p[i].Y-1);
		ans-=c(t);
		t=find(Tree[lx],0,N-1,0,N-1);
		ans-=c(t);
		t=find(Tree[n],0,N-1,0,N-1)-find(Tree[rx-1],0,N-1,0,N-1);
		ans-=c(t);
		t=find(Tree[lx],0,N-1,p[i].Y+1,N-1);
		ans+=c(t);
		t=find(Tree[lx],0,N-1,0,p[i].Y-1);
		ans+=c(t);
		t=find(Tree[n],0,N-1,p[i].Y+1,N-1)-find(Tree[rx-1],0,N-1,p[i].Y+1,N-1);
		ans+=c(t);
		t=find(Tree[n],0,N-1,0,p[i].Y-1)-find(Tree[rx-1],0,N-1,0,p[i].Y-1);
		ans+=c(t);
		ans%=MOD;
		if(ans<0)ans+=MOD;
	}
	printf("%lld",ans);
}

Measured memory_bytes: 134260