#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5,M=998244353;
int n,b[N],c[N];
long long g[N],ans;
struct BIT{
	int tr[N];
	void Ad(int i,int x){
		for(;i<=n;i+=i&-i)tr[i]+=x;
	}
	int Qr(int i){
		int rs=0;
		for(;i;i-=i&-i)rs+=tr[i];
		return rs;
	}
}T1,T2;
void ck(long long &x){if(x>=M)x-=M;}
struct P{
	int x,y;
	bool operator < (const P&t)const{
		return x<t.x;
	}
}a[N];
long long so(int ul,int ur,int dl,int dr){
	long long rs=g[n-1];
	rs+=(g[ul]-1)*(g[dr]-1)%M*(g[ur]+g[dl]-1)%M;ck(rs);
	rs+=(g[ur]-1)*(g[dl]-1)%M*(g[ul]+g[dr]-1)%M;ck(rs);
	rs+=(g[ur]-1)*(g[dl]-1)%M*(g[ul]-1)%M*(g[dr]-1)%M;ck(rs);
	return rs;
}
int main(){
	scanf("%d",&n);g[0]=1;
	for(int i=1;i<=n;++i){
		scanf("%d %d",&a[i].x,&a[i].y);
		b[i]=a[i].y;
		c[i]=a[i].x;
		g[i]=g[i-1]<<1;
		ck(g[i]);
	}
	sort(a+1,a+n+1);
	sort(b+1,b+n+1);
	sort(c+1,c+n+1);
	for(int i=1;i<=n;++i){
		a[i].y=lower_bound(b+1,b+n+1,a[i].y)-b;
		a[i].x=lower_bound(c+1,c+n+1,a[i].x)-c;
		T2.Ad(a[i].y,1);
	}
	for(int i=1;i<=n;++i){
		T2.Ad(a[i].y,-1);T1.Ad(a[i].y,1);
		int dl=T1.Qr(a[i].y-1),dr=T2.Qr(a[i].y-1);
		int ul=i-dl-1,ur=n-i-dr;
		ans+=so(ul,ur,dl,dr);
		ck(ans);
	}
	printf("%lld\n",ans);
}