//O(N^2) TLE

//g++ 2.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)

using mint = modint998244353;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin>>n;

  mint ans=0;
  vector<pair<ll,ll>> point(n);
  rep(i,0,n){
    ll x,y;
    cin>>x>>y;
    point[i].fi=x;
    point[i].se=y;
  }

  rep(i,0,n){
    rep(j,i+1,n){
      ll dist=abs(point[i].fi-point[j].fi)+abs(point[i].se-point[j].se);
      dist*=dist;
      ans+=dist;
    }
  }

  cout<<ans.val()<<"\n";
}