#include <bits/stdc++.h> #include <chrono> using namespace std; #define reps(i,s,n) for(int i = s; i < n; i++) #define rep(i,n) reps(i,0,n) #define Rreps(i,n,e) for(int i = n - 1; i >= e; --i) #define Rrep(i,n) Rreps(i,n,0) #define ALL(a) a.begin(), a.end() #define fi first #define se second typedef long long ll; typedef vector<ll> vec; typedef vector<vec> mat; ll N,M,H,W,Q,K,A,B; string S; typedef pair<ll, ll> P; const ll INF = (1LL<<58); class mint{ public: ll x; static unsigned long long mod; static unsigned long long mod_plus; mint(){x = 0;} mint(ll _x) : x((_x < 0 ? ((_x += mod_plus) < 0 ? _x + mod_plus : _x) : _x)%mod){} /*mint& operator=(const ll &a){ x = a; return *this; }*/ mint operator-(){ return x == 0 ? 0 : mod - x; } mint& operator+=(const mint& a){ if((x += a.x) >= mod) x -= mod; return *this; } mint operator+(const mint& a) const{ mint res(*this); return res += a; } mint& operator-=(const mint& a){ if((x -= a.x) < 0) x += mod; return *this; } mint operator-(const mint& a) const{ mint res(*this); return res -= a; } mint& operator*=(const mint& a){ (x *= a.x)%=mod; return *this; } /*mint& operator*=(const ll& a){ mint temp(a); return *this *= temp; }*/ mint operator*(const mint& a) const{ mint res(*this); return res *= a; } /*mint operator*(const ll& a) const{ mint res(*this); return res *= a; }*/ mint pow(unsigned long long pw) const{ mint res(1), comp(*this); while(pw){ if(pw&1) res *= comp; comp *= comp; pw >>= 1; } return res; } //以下、modが素数のときのみ mint inv() const{ mint res(*this); return res.pow(mod - 2); } mint& operator/=(const mint &a){ (x *= a.inv().x)%=mod; return *this; } mint operator/(const mint &a) const{ mint res(*this); return res /= a; } }; ostream& operator<<(ostream& os, const mint& a){ os << a.x; return os; } unsigned long long mint::mod = 998244353; unsigned long long mint::mod_plus = (LLONG_MAX / mint::mod) * mint::mod; typedef vector<mint> vm; const ll MAX_N = ll(4e+5) + 10; vm fact(MAX_N, mint(1)), fact_inv(MAX_N, mint(1)); void makefact(){ reps(i,2,MAX_N) { fact[i] = fact[i-1] * mint(i); fact_inv[i] = fact[i].inv(); } } mint nCm(ll n, ll m){ return fact[n] * fact_inv[n-m] * fact_inv[m]; } mint nCm_inv(ll n, ll m){ return fact[n-m] * fact[m] * fact_inv[n]; } int main() { class BIT{ ll n; unordered_map<int, int> bitree; public: BIT(unsigned long _n){ n = _n; } void add(ll id, ll x){ while(id <= n){ bitree[id] += x; id += id & -id; } return; } ll sum(ll id){ ll temp = 0; while(id > 0){ temp += bitree[id]; id -= id & -id; } return temp; } }; makefact(); cin>>N; if(N == 1){ cout<<0<<endl; return 0; } vec a(N); rep(i,N) cin>>a[i]; mint tento_sum(0), mini_sum(0), in_group(0), bet_group(1), comb_mul(1), temp(0); BIT bit(ll(1e+9) + 10); rep(i,N){ tento_sum += i - bit.sum(a[i]); bit.add(a[i], 1); } //rep(i, N) mini_sum += bit.sum(a[i] - 1); sort(ALL(a)); rep(i, N) mini_sum += lower_bound(ALL(a), a[i]) - a.begin(); rep(i, N) comb_mul *= nCm(N, i + 1); reps(i, 2, N + 1){ in_group += nCm(N - 2, i - 2) * nCm_inv(N, i); } in_group *= comb_mul * tento_sum; (bet_group *= comb_mul * mini_sum) /= N; reps(i, 1, N + 1) temp += mint((N * (N + 1) - (ll)i * (i + 1)) / 2) * nCm(N - 1, i - 1) * nCm_inv(N, i); bet_group *= temp; cout<<(in_group + bet_group)<<endl; //cout<<in_group<<' '<<bet_group<<endl; }