#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
//1-indexed
#include<vector>
template<typename T>
struct BIT{
	int n;
	vector<T>bit;
	BIT(int n_=0):n(n_),bit(n_+1){}
	T sum(int i)
	{
		T ans=0;
		for(;i>0;i-=i&-i)ans+=bit[i];
		return ans;
	}
	void add(int i,T a)
	{
		if(i==0)return;
		for(;i<=n;i+=i&-i)bit[i]+=a;
	}
	int lower_bound(T k)//k<=sum(ret)
	{
		if(k<=0)return 0;
		int ret=0,i=1;
		while((i<<1)<=n)i<<=1;
		for(;i;i>>=1)
			if(ret+i<=n&&bit[ret+i]<k)k-=bit[ret+=i];
		return ret+1;
	}
};
int N;
int X[2<<17],Y[2<<17];
pair<int,int>xy[2<<17];
long ans,mod=998244353,F[2<<17];
int main()
{
	cin>>N;
	F[0]=1;
	for(int i=1;i<=N;i++)F[i]=F[i-1]*2%mod;
	for(int i=0;i<N;i++)
	{
		cin>>X[i]>>Y[i];
		xy[i]=make_pair(X[i],Y[i]);
	}
	sort(X,X+N);
	sort(Y,Y+N);
	BIT<int>up(N),down(N);
	for(int i=0;i<N;i++)
	{
		xy[i].first=lower_bound(X,X+N,xy[i].first)-X+1;
		xy[i].second=lower_bound(Y,Y+N,xy[i].second)-Y+1;
		down.add(xy[i].second,1);
	}
	sort(xy,xy+N);
	long ans=0;
	for(int i=0;i<N;i++)
	{
		down.add(xy[i].second,-1);
		int a=up.sum(xy[i].second);
		int b=i-a;
		int c=down.sum(xy[i].second);
		int d=(N-i-1)-c;
		long aX=(F[a]+F[d]+mod-1)%mod;
		long aY=(F[b]+F[c]+mod-1)%mod;
		(ans+=F[N]-aX*aY%mod+mod)%=mod;
		up.add(xy[i].second,1);
	}
	cout<<ans<<endl;
}
