# https://yukicoder.me/submissions/1149633 を愚直に人力翻訳 # ACLpyのModintの使い方分からなかった(´；ω；｀) # ACLがyukicoderで使えないっぽいのでchokugaki # https://github.com/not522/ac-library-python/blob/master/atcoder/_bit.py def _ceil_pow2(n: int) -> int: x = 0 while (1 << x) < n: x += 1 return x def _bsf(n: int) -> int: x = 0 while n % 2 == 0: x += 1 n //= 2 return x # https://github.com/not522/ac-library-python/blob/master/atcoder/lazysegtree.py import typing class LazySegTree: def __init__( self, op: typing.Callable[[typing.Any, typing.Any], typing.Any], e: typing.Any, mapping: typing.Callable[[typing.Any, typing.Any], typing.Any], composition: typing.Callable[[typing.Any, typing.Any], typing.Any], id_: typing.Any, v: typing.Union[int, typing.List[typing.Any]]) -> None: self._op = op self._e = e self._mapping = mapping self._composition = composition self._id = id_ if isinstance(v, int): v = [e] * v self._n = len(v) self._log = _ceil_pow2(self._n) self._size = 1 << self._log self._d = [e] * (2 * self._size) self._lz = [self._id] * self._size for i in range(self._n): self._d[self._size + i] = v[i] for i in range(self._size - 1, 0, -1): self._update(i) def set(self, p: int, x: typing.Any) -> None: assert 0 <= p < self._n p += self._size for i in range(self._log, 0, -1): self._push(p >> i) self._d[p] = x for i in range(1, self._log + 1): self._update(p >> i) def get(self, p: int) -> typing.Any: assert 0 <= p < self._n p += self._size for i in range(self._log, 0, -1): self._push(p >> i) return self._d[p] def prod(self, left: int, right: int) -> typing.Any: assert 0 <= left <= right <= self._n if left == right: return self._e left += self._size right += self._size for i in range(self._log, 0, -1): if ((left >> i) << i) != left: self._push(left >> i) if ((right >> i) << i) != right: self._push((right - 1) >> i) sml = self._e smr = self._e while left < right: if left & 1: sml = self._op(sml, self._d[left]) left += 1 if right & 1: right -= 1 smr = self._op(self._d[right], smr) left >>= 1 right >>= 1 return self._op(sml, smr) def all_prod(self) -> typing.Any: return self._d[1] def apply(self, left: int, right: typing.Optional[int] = None, f: typing.Optional[typing.Any] = None) -> None: assert f is not None if right is None: p = left assert 0 <= left < self._n p += self._size for i in range(self._log, 0, -1): self._push(p >> i) self._d[p] = self._mapping(f, self._d[p]) for i in range(1, self._log + 1): self._update(p >> i) else: assert 0 <= left <= right <= self._n if left == right: return left += self._size right += self._size for i in range(self._log, 0, -1): if ((left >> i) << i) != left: self._push(left >> i) if ((right >> i) << i) != right: self._push((right - 1) >> i) l2 = left r2 = right while left < right: if left & 1: self._all_apply(left, f) left += 1 if right & 1: right -= 1 self._all_apply(right, f) left >>= 1 right >>= 1 left = l2 right = r2 for i in range(1, self._log + 1): if ((left >> i) << i) != left: self._update(left >> i) if ((right >> i) << i) != right: self._update((right - 1) >> i) def max_right( self, left: int, g: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= left <= self._n assert g(self._e) if left == self._n: return self._n left += self._size for i in range(self._log, 0, -1): self._push(left >> i) sm = self._e first = True while first or (left & -left) != left: first = False while left % 2 == 0: left >>= 1 if not g(self._op(sm, self._d[left])): while left < self._size: self._push(left) left *= 2 if g(self._op(sm, self._d[left])): sm = self._op(sm, self._d[left]) left += 1 return left - self._size sm = self._op(sm, self._d[left]) left += 1 return self._n def min_left(self, right: int, g: typing.Any) -> int: assert 0 <= right <= self._n assert g(self._e) if right == 0: return 0 right += self._size for i in range(self._log, 0, -1): self._push((right - 1) >> i) sm = self._e first = True while first or (right & -right) != right: first = False right -= 1 while right > 1 and right % 2: right >>= 1 if not g(self._op(self._d[right], sm)): while right < self._size: self._push(right) right = 2 * right + 1 if g(self._op(self._d[right], sm)): sm = self._op(self._d[right], sm) right -= 1 return right + 1 - self._size sm = self._op(self._d[right], sm) return 0 def _update(self, k: int) -> None: self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1]) def _all_apply(self, k: int, f: typing.Any) -> None: self._d[k] = self._mapping(f, self._d[k]) if k < self._size: self._lz[k] = self._composition(f, self._lz[k]) def _push(self, k: int) -> None: self._all_apply(2 * k, self._lz[k]) self._all_apply(2 * k + 1, self._lz[k]) self._lz[k] = self._id ## ここまでACL import bisect from sys import stdin input = stdin.readline MOD = 998244353 def rev(x): return pow(x, MOD - 2, MOD) def op(a, b) : return ((a[0] * (1 - a[1]) + b[0] * (1 - b[1])) % MOD, 0) e = (1, 1) def mapping(f, x) : return ((x[0] * f) % MOD, x[1]) def composition(f, g) : return f * g % MOD _id = 1 f34 = 3 * rev(4) % MOD f43 = rev(f34) N = int(input().rstrip()) X = [0 for i in range(N)] Y = [0 for i in range(N)] for i in range(N): X[i], Y[i] = map(int, input().rstrip().split()) zX = sorted(set(X)) zY = sorted(set(Y)) if len(zX) == 1 or len(zY) == 1: print(0) exit() rX = [bisect.bisect_left(zX, x) for x in X] rY = [bisect.bisect_left(zY, y) for y in Y] ans = 0 for _ in range(2): G = [[] for i in range(len(zX))] for i in range(N): G[rX[i]].append(rY[i]) V = [e for i in range(len(zY))] for i in range(N): if rY[i] + 1 < len(zY): V[rY[i] + 1] = (V[rY[i] + 1][0] * f34 % MOD, 1) for i in range(1, len(zY)): V[i] = (V[i-1][0] * V[i][0] % MOD, 1) seg = LazySegTree(op, e, mapping, composition, _id, V) fs = 1 for i in range(len(zX) - 1): for y in G[i]: seg.set(y, (seg.get(y)[0], seg.get(y)[1] * f34 % MOD)) seg.apply(0, y, f34) seg.apply(y+1, len(zY), f43) fs = fs * f34 % MOD all_prd = seg.all_prod() ans += (1 - all_prd[0] - fs) * (zX[i + 1] - zX[i]) % MOD ans %= MOD rX, rY = rY, rX zX, zY = zY, zX for i in range(N): ans = ans * 4 % MOD ans = ans * 2 % MOD print(ans)