#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;
#include <atcoder/segtree>

struct F{
    array<mint, 2> C;
    array<array<mint, 2>, 2> D;
    int Lpos = -1;
    int Rpos = -1;
    mint sum = 0;
};

F op(F l, F r){
    if (l.Lpos == -1) return r;
    if (r.Rpos == -1) return l;
    l.sum += r.sum;
    mint dist = r.Lpos - l.Rpos;
    rep(a, 0, 2){
        int b = 1 - a;
        l.sum += l.C[a] * r.C[b] * dist;
        l.sum += l.D[a][1] * r.C[b];
        l.sum += r.D[b][0] * l.C[a];
    }
    rep(i, 0, 2){
        l.D[i][1] += l.C[i] * (r.Rpos - l.Rpos);
        r.D[i][0] += r.C[i] * (r.Lpos - l.Lpos);
    }
    rep(i, 0, 2){
        l.C[i] += r.C[i];
        rep(j, 0, 2){
            l.D[i][j] += r.D[i][j];
        }
    }
    l.Rpos = r.Rpos;
    return l;
}
F e(){
    F tmp;
    rep(i, 0, 2){
        tmp.C[i] = 0;
        rep(j, 0, 2) tmp.D[i][j] = 0;
    }
    return tmp;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<pair<int, int>> p(N);
    rep(i, 0, N) cin >> p[i].first >> p[i].second;
    mint ans = 0;
    rep(rp, 0, 2){
        vector<int> X(N);
        rep(i, 0, N) X[i] = p[i].first, swap(p[i].first, p[i].second);
        So(X);
        vector<mint> dp(3);
        dp[0] = 1;
        rep(i, 1, N) {
            mint d = X[i] - X[i - 1];
            dp[2] += dp[1] * d * 2;
            dp[2] += dp[0] * d * d;
            dp[1] += dp[0] * d;
            dp[0] += 1;
            ans += dp[2];
        }
    }
    So(p);
    vector<int> order(N);
    rep(i, 0, N) order[i] = i;
    sort(all(order), [&](int l, int r){
        return p[l].second < p[r].second;
    });
    atcoder::segtree<F, op, e> seg(N);
    rep(i, 0, N){
        auto tmp = e();
        tmp.Lpos = tmp.Rpos = p[i].first;
        tmp.C[0] = 1;
        seg.set(i, tmp);
    }
    rep(i, 0, N - 1){
        auto tmp = e();
        tmp.Lpos = tmp.Rpos = p[order[i]].first;
        tmp.C[1] = 1;
        seg.set(order[i], tmp);
        tmp = seg.all_prod();
        ans += tmp.sum * (p[order[i + 1]].second - p[order[i]].second) * 2;
    }
    cout << ans.val() << "\n";
}