/*
Author: QAQ Automaton
Lang: C++
Prog: f.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define int long long 
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define inf 0x3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f3f
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>int chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>int chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	// input a signed integer
	inline bool read (signed &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}

	inline bool read (long long &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		x=gc();
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r')if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	// print a signed integer
	inline bool write (signed x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}

	inline bool write (long long x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
const int p=998244353;
pii a[200005];
vector<int> xs,ys;
int w1[200005],w2[200005];
int w3[200005],w4[200005];
int s[200005];
int n;
void add(int x,int y){
	for(;x<=n;x+=x&-x)s[x]+=y;
}
int sum(int x){
	int y=0;for(;x;x^=x&-x)y+=s[x];return y;
}
int w[200005],g[200005];
int calc(int a,int b,int c,int d){
	int ans=w[a+b+c+d];
	ans=(ans+
		g[a]*g[d]%p+
		g[b]*g[c]%p+
		g[a]*g[b]%p*g[c]%p+
		g[a]*g[c]%p*g[d]%p+
		g[b]*g[c]%p*g[d]%p+
		g[a]*g[b]%p*g[d]%p+
		g[a]*g[b]%p*g[c]%p*g[d])%p;
	return ans;
} 
signed main(){
#ifdef QAQAutoMaton 
	freopen("f.in","r",stdin);
	freopen("f.out","w",stdout);
#endif
	read(n);
	w[0]=1;
	for(int i=1;i<=n;++i)w[i]=(w[i-1]<<1)%p;
	for(int i=0;i<=n;++i)g[i]=w[i]-1;
	for(int i=1;i<=n;++i){
		read(a[i].x,a[i].y);
		xs.push_back(a[i].x);
		ys.push_back(a[i].y);
	}
	sort(all(xs));
	sort(all(ys));
	for(int i=1;i<=n;++i)a[i].x=lower_bound(all(xs),a[i].x)-xs.begin()+1;
	for(int i=1;i<=n;++i)a[i].y=lower_bound(all(ys),a[i].y)-ys.begin()+1;
	sort(a+1,a+n+1);	
	for(int i=1;i<=n;++i){
		w1[i]=sum(a[i].y);
		w2[i]=i-w1[i]-1;
		add(a[i].y,1);
	}
	for(int i=1;i<=n;++i)s[i]=0;
	for(int i=n;i;--i){
		w3[i]=sum(a[i].y);
		w4[i]=n-i-w3[i];
		add(a[i].y,1);
	}
	int ans=0;
	for(int i=1;i<=n;++i){
		ans=(ans+calc(w1[i],w2[i],w3[i],w4[i]))%p;
	}
	write(ans,'\n');
	return 0;
}



Measured memory_bytes: 21732