#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
ll f[1000010], invf[1000010];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i%MOD;
    invf[n]=inv(f[n]);
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
}
ll comb(int x, int y){
    if(!(0<=y && y<=x)) return 0;
    return f[x]*invf[y]%MOD*invf[x-y]%MOD;
}
template<typename T>
struct BIT{
    vector<T> bit;
    int size;
    BIT(int n):size(n), bit(n+1, 0){}
    T sum(int i){ //[0, i)
        T s=0;
        while(i>0){
            s+=bit[i];
            i-=(i&(-i));
        }
        return s;
    }
    T sum(int l, int r){ //[l, r)
        return sum(r)-sum(l);
    }
    void add(int i, T x){
        i++;
        while(i<=size){
            bit[i]+=x;
            i+=(i&(-i));
        }
    }
};
int main()
{
    int n; cin>>n;
    int a[200020];
    vector<int> va(n);
    map<int, int> mp;
    for(int i=0; i<n; i++){
        cin>>a[i];
        va[i]=a[i];
        mp[a[i]]++;
    }
    sort(va.begin(), va.end());
    va.erase(unique(va.begin(), va.end()), va.end());
    for(int i=0; i<n; i++) a[i]=lower_bound(va.begin(), va.end(), a[i])-va.begin();
    ll x=0;
    int m=va.size();
    BIT<int> bit(m);
    for(int i=0; i<n; i++){
        x+=bit.sum(a[i]+1, m);
        bit.add(a[i], 1);
    }
    x%=MOD;
    fac(n);
    ll tot=1;
    for(int i=1; i<=n; i++) (tot*=comb(n, i))%=MOD;
    ll y=0;
    for(int i=2; i<=n; i++){
        (y+=comb(n-2, i-2)*inv(comb(n, i)))%=MOD;
    }
    ll ans=x*y%MOD*tot%MOD;
    x=comb(n, 2);
    for(auto p:mp) (x+=MOD-comb(p.second, 2))%=MOD;
    ll s1=0, s2=0;
    for(int i=1; i<=n; i++){
        ll z=comb(n-1, i-1)*inv(comb(n, i))%MOD;
        (s1+=z)%=MOD;
        (s2+=z*z)%=MOD;
    }
    ll s=(s1*s1-s2+MOD)%MOD*((MOD+1)/2)%MOD;
    (ans+=x*s%MOD*tot)%=MOD;
    cout<<ans<<endl;
    return 0;
}