#include "bits/stdc++.h" #include "atcoder/all" using namespace std; using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; //const bool debug = false; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } struct ele { mint c, x, y, xy; ele() :c(0), x(0), y(0), xy(0) {} ele(mint _c, mint _x, mint _y, mint _xy) :c(_c), x(_x), y(_y), xy(_xy) {} ele operator+(const ele &other) { ele ret; ret.c = c + other.c; ret.x = x + other.x; ret.y = y + other.y; ret.xy = xy + other.xy; return ret; } }; ele op(ele a, ele b) {return a + b;} ele e() { ele c; return c; } map Compless(const vector &v) { vectorvv = v; sort(all(vv)); vv.erase(unique(all(vv)), vv.end()); mapmp; rep(i, vv.size()) { mp[vv[i]] = i; } return mp; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector

xy(n); rep(i, n)cin >> xy[i].first >> xy[i].second; mint sumx = 0, sumy = 0; rep(i, n) { sumx += xy[i].first; sumy += xy[i].second; } mint ans = 0; rep(i, n) { ans += xy[i].first * xy[i].first; ans += xy[i].second * xy[i].second; } ans *= n; ans -= sumx * sumx + sumy * sumy; sort(all(xy)); vectorcopyy(n); rep(i, n)copyy[i] = xy[i].second; auto mp = Compless(copyy); int sz = mp.size(); segtreeseg(sz); mint anssub = 0; rep(i, n) { int idx = mp[xy[i].second]; { // r ele now = seg.prod(idx, sz); anssub -= now.c*xy[i].first * xy[i].second; anssub -= now.xy; anssub += now.y * xy[i].first; anssub += now.x * xy[i].second; } { // l ele now = seg.prod(0, idx); anssub += now.c*xy[i].first * xy[i].second; anssub += now.xy; anssub -= now.y * xy[i].first; anssub -= now.x * xy[i].second; } { // update ele bef = seg.get(idx); ele add(1,xy[i].first,xy[i].second,xy[i].first*xy[i].second); ele aft = bef + add; seg.set(idx, aft); } } ans += anssub * 2; cout << ans.val() << endl; return 0; }