import sys # sys.setrecursionlimit(1000005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 62) # md = 10**9+7 md = 998244353 class BitSum: def __init__(self, n): self._n = n+1 self._table = [0]*self._n def add(self, i, x): if x == 0: return i += 1 while i < self._n: self._table[i] += x self._table[i] %= md i += i & -i def sum(self, r): res = 0 while r > 0: res += self._table[r] res %= md r -= r & -r return res n = II() xy = LLI(n) xy.sort() dec = sorted(set(y for x, y in xy)) enc = {a: i for i, a in enumerate(dec)} s = t = s2 = t2 = u = 0 cbit = BitSum(len(dec)) xbit = BitSum(len(dec)) ybit = BitSum(len(dec)) xybit = BitSum(len(dec)) ans = 0 for p, (x, y) in enumerate(xy): # (x-X+y-Y)2 # x2+X2+y2+Y2-2xX+2xy-2xY-2yX+2XY-2yY # x2+y2+X2+Y2-2(xX+yY)+2(xy-xY-yX+XY) (Y=y) ans += p*(x*x%md+y*y%md)%md+s2+t2-2*(x*s%md+y*t%md) i = enc[y] c = cbit.sum(i) xb = xbit.sum(i) yb = ybit.sum(i) xyb = xybit.sum(i) # ans += 2*(c*x*y%md-x*yb%md-y*xb%md+xyb)-2*((p-c)*x*y%md-x*(t-yb)%md-y*(s-xb)%md+(u-xyb)) ans += 2*((2*c-p)*x*y%md-x*(2*yb-t)%md-y*(2*xb-s)%md+2*xyb-u) ans %= md x2 = x*x%md y2 = y*y%md xy = x*y%md s += x s2 += x2 t += y t2 += y2 u += xy s %= md s2 %= md t %= md t2 %= md u %= md cbit.add(i, 1) xbit.add(i, x) ybit.add(i, y) xybit.add(i, xy) print(ans)