#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 998244353
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << endl
#define p7(a, b, c, d, e, f, g) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" << f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                         \
    idp                                    \
    {                                      \
        rep(i, n) { cout << x[i] << " "; } \
        puts("");                          \
    }
#define dump2(x, n)                                                     \
    idp                                                                 \
    {                                                                   \
        rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
        puts("");                                                       \
    }
#define dumpi(x)                  \
    idp                           \
    {                             \
        foreach (it, x)           \
        {                         \
            cout << (*it) << " "; \
        }                         \
        puts("");                 \
    }
#define dumpi2(x)                                               \
    idp                                                         \
    {                                                           \
        foreach (it, x)                                         \
        {                                                       \
            cout << "[" << (it)->F << " , " << (it)->S << "] "; \
        }                                                       \
        puts("");                                               \
    }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                   \
    rep(i, h)                             \
    {                                     \
        rep(j, w) cout << a[i][j] << " "; \
        puts("");                         \
    }

typedef pair<li, li> PI;


// segtree ----------------------------------
// verified: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_A

template<typename T>
class Segtree {
public:
	Segtree(li n,
	        T default_value,
	        T invalid_value_,
	        std::function<T(T, T)> func_) : invalid_value(invalid_value_),
		func(func_) {
		nn = 1;
		while (nn < n) {
			nn *= 2;
		}
		data.resize(nn * 2 - 1);
		for (auto && item : data) {
			item = default_value;
		}
	}

	inline void update(li i, T x) {
		i += nn - 1;
		data[i] = x;
		while (i > 0) {
			i = (i - 1) / 2;
			data[i] = func(data[i * 2 + 1], data[i * 2 + 2]);
		}
	}

	inline T query_(li a, li b, li k, li l, li r) {
		if (r <= a || b <= l) return invalid_value;
		if (a <= l && r <= b) return data[k];
		li mid = (l + r) / 2;
		li vl = query_(a, b, k * 2 + 1, l, mid);
		li vr = query_(a, b, k * 2 + 2, mid, r);
		return func(vl, vr);
	}

	inline T query(li a, li b) {
		li l = 0;
		li r = nn;
		li k = 0;
		if (r <= a || b <= l) return invalid_value;
		if (a <= l && r <= b) return data[k];
		li mid = (l + r) / 2;
		li vl = query_(a, b, k * 2 + 1, l, mid);
		li vr = query_(a, b, k * 2 + 2, mid, r);
		return func(vl, vr);
	}

	li nn;
	vector<T> data;
	T invalid_value;
	function<T(T, T)> func;
};
// segtree --------------------------------//


li n;

PI xy[200200];

// 自分の左下に何個相手がいるか
li hidari_shita[200200];

// b[i]=2^n%MOD
li b[200200];

int main(void)
{
	cin >> n;
	b[0] = 1;
	rin{
		b[i + 1] = b[i] * 2 % MOD;
	}
	Segtree<li> segtree(n + 2, 0, 0, [](li a, li b) {return a + b;});
	rin{
		cin >> xy[i].F >> xy[i].S;
	}
	// セグ木に載せるために座圧する
	{
		map<li, li> m;
		rin{
			m[xy[i].S] = 0;
		}
		li cnt = 0;
		for (auto && kv : m) {
			m[kv.F] = cnt;
			cnt++;
		}
		rin{
			xy[i].S = m[xy[i].S];
		}
	}
	{
		map<li, li> m;
		rin{
			m[xy[i].F] = 0;
		}
		li cnt = 0;
		for (auto && kv : m) {
			m[kv.F] = cnt;
			cnt++;
		}
		rin{
			xy[i].F = m[xy[i].F];
		}
	}

	sort(xy, xy + n);

	rin{
		hidari_shita[i] = segtree.query(0, xy[i].S);
		segtree.update(xy[i].S, 1);
	}

	li res = 0;
	//dump2(xy, n);
	rin{
		res = (res + b[n - 1]) % MOD; // 自分自身選んだ場合
		li hidari_ue = xy[i].F - hidari_shita[i];
		li migi_shita = xy[i].S - hidari_shita[i];
		li migi_ue = n - 1 - xy[i].F - migi_shita;

		//p4(hidari_shita[i], hidari_ue, migi_shita, migi_ue);

		li num_hidari_ue = (b[hidari_ue] - 1 + MOD) % MOD;
		li num_hidari_shita = (b[hidari_shita[i]] - 1 + MOD) % MOD;
		li num_migi_ue = (b[migi_ue] - 1 + MOD) % MOD;
		li num_migi_shita = (b[migi_shita] - 1 + MOD) % MOD;

		li p1 = ((num_migi_shita * num_hidari_ue % MOD) * b[migi_ue + hidari_shita[i]] % MOD
		+ (num_migi_ue * num_hidari_shita % MOD) * b[migi_shita + hidari_ue] % MOD) % MOD;
		li p2 = (num_migi_shita * num_hidari_ue % MOD) * (num_migi_ue * num_hidari_shita % MOD) % MOD;
		//p3(i, p1, p2);
		res = (res + p1 - p2 + MOD) % MOD;
	}

	cout << res << endl;



	return 0;
}

Measured memory_bytes: 24704