#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
ll n,seg[400010],INF = 1000000000000;
void update(int p,ll val){
    for(seg[p += n] += val;p>1;p>>=1){
        seg[p>>1] = seg[p] + seg[p^1];
    }
}

ll query(int l,int r){
    ll res = 0;
    for(l += n,r += n; l<r;l>>=1,r>>=1){
        if(l&1) res += seg[l++];
        if(r&1) res += seg[--r];
    }
    return res;
}
int a[200010],b[200010] = {};
map<int,int> mp;
constexpr ll mod = 998244353;
const int MX = 1000100;
ll f[MX],inv[MX],fi[MX];
void solve(){
    inv[1] = 1;
    for(int i=2;i<MX;i++){
        inv[i] = mod - (mod/i)*inv[mod%i]%mod;
    }
   f[0] = fi[0] = 1;
    for(int i=1;i<MX;i++){
        f[i] = f[i-1]*i%mod;
        fi[i] = fi[i-1]*inv[i]%mod;
    }
}

ll nck(ll n, ll k){
    if(n<0 || k<0 || n<k) return 0;
    return f[n]*fi[k]%mod*fi[n-k]%mod;
}

ll pw(ll a,ll x){
    a %= mod;
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        x /= 2; (a *= a) %= mod;
    }
    return ret;
}
int main(){
    ll i; cin >> n;
    for(i=0;i<n;i++){
        cin >> a[i]; mp[a[i]] = 1;
    }
    int cnt = 0;
    for(auto x:mp){
        mp[x.first] = cnt; cnt++;
    }
    for(i=0;i<n;i++) a[i] = mp[a[i]];
    for(i=0;i<n;i++) b[a[i]]++;
    ll tento = 0,sum = 0,sum1 = 0;;
    for(i=0;i<n;i++){
        update(a[i],1);
        tento += query(a[i] + 1,n);
    }
    for(i=n - 1;i>=0;i--){
        (sum += b[i]*sum1%mod) %=mod; (sum1 += b[i]) %= mod;
    }
    solve();
    ll ans = 0;
    for(i=1;i<=n;i++) (ans += i*i%mod*(i - 1)%mod) %= mod;
    (ans *= sum) %= mod;
    (ans *= pw(2*n*n,mod - 2)) %= mod;
    ll ans1 = 0;
    for(i=1;i<=n;i++) (ans1 += i*(i - 1)%mod) %= mod;
    (ans1 *= tento) %= mod;
    (ans1 *= pw(n*(n - 1),mod -2)) %= mod;
    (ans += ans1) %= mod;
    ll ans2 = ans;
    for(i=1;i<=n;i++) (ans *= nck(n,i)) %= mod;
    cout << ans << endl;
}