#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<map>
#include<vector>
using namespace std;
int read(){
    int xx=0,ff=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')ff=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){xx=xx*10+ch-'0';ch=getchar();}
    return xx*ff;
}
long long READ(){
    long long xx=0,ff=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')ff=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){xx=xx*10+ch-'0';ch=getchar();}
    return xx*ff;
}
char one(){
	char ch=getchar();
	while(ch==' '||ch=='\n')
		ch=getchar();
	return ch;
}
const int maxn=200010,MOD=998244353;
struct coor{
	int x,y;
	bool friend operator<(const coor&A,const coor&B)
	{return A.x<B.x;}
}C[maxn];
int N,X[maxn],Y[maxn],pow2[maxn];
map<int,int>mx,my;
struct BIT{
	int b[maxn];
	inline int lowbit(int x)
	{return x&(-x);}
	void upd(int x,int d){
		for(;x<maxn;x+=lowbit(x))
			(b[x]+=d)%=MOD;
	}
	int query(int x){
		int ret=0;
		for(;x;x-=lowbit(x))
			(ret+=b[x])%=MOD;
		return ret;
	}
}bit;
int main(){
	//freopen("in","r",stdin);
	N=read();
	for(int i=1;i<=N;i++)
		X[i]=C[i].x=read(),Y[i]=C[i].y=read();
	sort(X+1,X+1+N);
	sort(Y+1,Y+1+N);
	sort(C+1,C+1+N);
	pow2[0]=1;
	for(int i=1;i<=N;i++)
		mx[X[i]]=i,my[Y[i]]=i,pow2[i]=pow2[i-1]*2%MOD;
	for(int i=1;i<=N;i++)
		C[i].x=mx[C[i].x],C[i].y=my[C[i].y];
	long long ans=0;
	for(int i=1;i<=N;i++){
		int U=C[i].y-1,D=N-C[i].y,L=i-1,R=N-i;
		int UL=bit.query(C[i].y-1),UR=U-UL,DL=i-UL-1,DR=D-DL;
		ans+=pow2[N];
		ans-=1LL*pow2[U]+pow2[D]+pow2[L]+pow2[R]-pow2[UL]-pow2[UR]-pow2[DL]-pow2[DR];
		ans--;
		ans%=MOD;
		bit.upd(C[i].y,1);
	}
	(ans+=MOD)%=MOD;
	cout<<ans<<endl;
	return 0;
}

