/*

This Submission is to determine how many 120/240 min const. delivery point there are.

//info
120 req. steps <= 5
*/
#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
#define eps 1e-5
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define seg_size 262144
#define REP(a,b) for(long long a = 0;a < b;++a)

unsigned long xor128() {
	static unsigned long x = time(NULL), y = 362436069, z = 521288629, w = 88675123;
	unsigned long t = (x ^ (x << 11));
	x = y; y = z; z = w;
	return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
double dot(complex<double> a, complex<double> b) {
	return a.real() * b.real() + a.imag() * b.imag();
}
double gyaku_dot(complex<double> a, complex<double> b) {
	return a.real() * b.imag() - a.imag() * b.real();
}
double leng(complex<double> a) {
	return sqrt(a.real() * a.real() + a.imag() * a.imag());
}
double angles(complex<double> a, complex<double> b) {
	double cosine = dot(a, b) / (leng(a) * leng(b));
	double sine = gyaku_dot(a, b) / (leng(a) * leng(b));
	double kaku = acos(min((double)1.0, max((double)-1.0, cosine)));
	if (sine <= 0) {
		kaku = 2 * Ma_PI - kaku;
	}
	return kaku;
}
vector<int> convex_hull(vector<complex<double>> a) {
	vector<int> ans;
	double now_minnest = a[0].real();
	int now_itr = 0;
	REP(i, a.size()) {
		if (now_minnest > a[i].real()) {
			now_minnest = a[i].real();
			now_itr = i;
		}
	}
	ans.push_back(now_itr);
	complex<double> ba(0, 1);
	while (true) {
		int now_go = 0;
		double now_min = 0;
		double now_length = 0;
		int starter = ans[ans.size() - 1];
		for (int i = 0; i < a.size(); ++i) {
			if (i != starter) {
				double goa = angles(ba, a[i] - a[starter]);
				if (goa - now_min >= eps || (abs(goa - now_min) <= eps && (abs(a[i] - a[starter]) - now_length) >= eps)) {
					now_min = goa;
					now_go = i;
					now_length = abs(a[i] - a[starter]);
				}
			}
		}
		if (now_go == ans[0]) break;
		ans.push_back(now_go);
		ba = complex<double>(a[now_go] - a[starter]);
	}
	return ans;
}
long long powing(long long A, long long B) {
	long long ans = 1;
	while (B != 0) {
		if (B % 2 == 1) {
			ans *= A;
			ans %= MOD;
		}
		A *= A;
		A %= MOD;
		B /= 2;
	}
	return ans;
}
long long cnt[4][300000] = {};
long long seg_tree[seg_size * 4];
long long seg_find(long long now, long long n_l, long long n_r, long long w_l, long long w_r) {
	if (w_l <= n_l && n_r <= w_r) return seg_tree[now];
	if (w_r <= n_l || n_r <= w_l) return 0;
	return seg_find(now * 2, n_l, (n_l + n_r) / 2, w_l, w_r) + seg_find(now * 2 + 1, (n_l + n_r) / 2, n_r, w_l, w_r);
}
long long seg_set(long long now) {
	seg_tree[now] = seg_tree[now * 2] + seg_tree[now * 2 + 1];
	if (now != 1) seg_set(now / 2);
	return 0;
}
int main() {
	int n;
	cin >> n;
	vector<pair<int, int>> inputs;
	map<int, int> X, Y;
	REP(i, n) {
		int a, b;
		cin >> a >> b;
		X[a] = 1;
		Y[b] = 1;
		inputs.push_back(make_pair(a, b));
	}
	int tmp = 0;
	for (auto i = X.begin(); i != X.end(); ++i) {
		i->second = tmp;
		tmp++;
	}
	tmp = 0;
	for (auto i = Y.begin(); i != Y.end(); ++i) {
		i->second = tmp;
		tmp++;
	}
	REP(i, n) {
		inputs[i] = make_pair(X[inputs[i].first], Y[inputs[i].second]);
	}
	sort(inputs.begin(), inputs.end());
	for (int i = 0; i < inputs.size(); ++i) {
		int go = inputs[i].second;
		cnt[0][i] = seg_find(1, 0, seg_size, 0, go);
		cnt[1][i] = i - cnt[0][i];
		seg_tree[(seg_size + go)]++;
		seg_set((seg_size + go) / 2);
	}
	REP(i, seg_size * 4) {
		seg_tree[i] = 0;
	}
	for (int i = inputs.size()-1; i >= 0; --i) {
		int go = inputs[i].second;
		cnt[3][i] = seg_find(1, 0, seg_size, 0, go);
		cnt[2][i] = ((int)inputs.size()-1 - i) - cnt[3][i];
		seg_tree[(seg_size + go)]++;
		seg_set((seg_size + go) / 2);
	}
	long long ans = n * powing(2, n - 1LL);
	ans %= MOD;
	for (int i = 0; i < n; ++i) {
		REP(j, 4) {
			cnt[j][i] = powing(2, cnt[j][i]) - 1LL;
		}
		ans += cnt[0][i] * cnt[2][i];
		ans %= MOD;
		ans += cnt[1][i] * cnt[3][i];
		ans %= MOD;
		for (int q = 0; q < 4; ++q) {
			long long nya = 1;
			for (int j = 0; j < 3; ++j) {
				nya *= cnt[(q + j) % 4][i];
				nya %= MOD;
			}
			ans += nya;
		}
		long long geko = 1;
		REP(j, 4) {
			geko *= cnt[j][i];
			geko %= MOD;
		}
		ans += geko;
		ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}


Measured memory_bytes: 39664