#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template<class T> using V = vector<T>;
using VI = V<int>;
using VL = V<ll>;
using VS = V<string>;
template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;
using graph = V<VI>;
template<class T> using w_graph = V<V<pair<int, T>>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 61;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline V<T> vec(size_t a) { return V<T>(a); }
template<class T>inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }
template<class T>inline T sum(const V<T>& a, int l, int r) { return 0 <= l && l <= r && r < a.size() ? a[r] - (l == 0 ? 0 : a[l - 1]) : 0; }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

template<class T> class BinaryIndexedTree {
    int n;
    vector<T> dat;
public:
    BinaryIndexedTree(int n) : n(n), dat(n + 1) {};
    void add(int i, T a) {
        for (++i; i <= n; i += i & -i)dat[i] += a;
    }
    T sum(int r) {// sum of [0,r)
        T res = 0;
        for (; r; r -= r & -r)res += dat[r];
        return res;
    }
    T sum(int l, int r) {// sum of [l,r)
        if (l < 0 || n < r || l > r)return 0;
        return sum(r) - sum(l);
    }
};

template<class T> class compress {
    vector<T> xs;
public:
    compress() {}
    compress(const vector<T>& vs) {
        add(vs);
    }
    inline void add(const vector<T>& vs) {
        copy(all(vs), back_inserter(xs));
    }
    inline void add(const T& x) {
        xs.emplace_back(x);
    }
    inline void build() {
        sort(all(xs));
        xs.erase(unique(all(xs)), xs.end());
    }
    inline int idx(const T& x) const {
        return lower_bound(all(xs), x) - xs.begin();
    }
    inline T operator[](int k) const {
        return xs[k];
    }
    inline int size() const {
        return xs.size();
    }
};

#include <atcoder/modint>
using mint = atcoder::modint998244353;
int main() {
    init();

    int n; cin >> n;
    compress<int> comp;
    V<pair<int, int>> point(n);
    FOR(i, 0, n) {
        cin >> point[i];
        comp.add(point[i].second);
    }
    comp.build();
    sort(all(point));

    mint ans = 0;
    BinaryIndexedTree<mint> x1(comp.size()), x2(comp.size()), y1(comp.size()), y2(comp.size()), xy(comp.size()), cnt(comp.size());
    FOR(i, 0, n) {
        auto [x, y] = point[i];
        int idx = comp.idx(y);

        mint c = x, d = y;
        {
            mint a1 = x1.sum(0, idx), a2 = x2.sum(0, idx), b1 = y1.sum(0, idx), b2 = y2.sum(0, idx), ab = xy.sum(0, idx),  m = cnt.sum(0, idx);

            ans += m * c * c;
            ans += -2 * a1 * c;
            ans += a2;

            ans += m * 2 * c * d;
            ans += -2 * c * b1;
            ans += -2 * a1 * d;
            ans += 2 * ab;

            ans += m * d * d;
            ans += -2 * b1 * d;
            ans += b2;
        }
        {
            mint a1 = x1.sum(idx, comp.size()), a2 = x2.sum(idx, comp.size()), b1 = y1.sum(idx, comp.size()), b2 = y2.sum(idx, comp.size()), ab = xy.sum(idx, comp.size()), m = cnt.sum(idx, comp.size());

            ans += m * c * c;
            ans += -2 * a1 * c;
            ans += a2;

            ans += 2 * c * b1;
            ans += m * -2 * c * d;
            ans += -2 * ab;
            ans += 2 * a1 * d;

            ans += b2;
            ans += -2 * b1 * d;
            ans += m * d * d;
        }
        
        x1.add(idx, c), x2.add(idx, c * c), y1.add(idx, d), y2.add(idx, d * d), xy.add(idx, c * d), cnt.add(idx, 1);
    }
    print(ans.val());

    return 0;
}