#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long modsub(long long a, long long b){
  return (a % MOD - b % MOD + MOD) % MOD;
}
long long modpow(long long a, long long b){
	long long ans = 1;
	while (b > 0){
		if (b % 2 == 1){
			ans *= a;
			ans %= MOD;
		}
		a *= a;
		a %= MOD;
		b /= 2;
	}
	return ans;
}
long long modinv(long long a){
	return modpow(a, MOD - 2);
}
vector<long long> mf = {1};
vector<long long> mfi = {1};
long long modfact(int n){
	if (mf.size() > n){
		return mf[n];
	} else {
		for (int i = mf.size(); i <= n; i++){
			long long next = mf.back() * i % MOD;
			mf.push_back(next);
			mfi.push_back(modinv(next));
		}
		return mf[n];
	}
}
long long modfactinv(int n){
	if (mfi.size() > n){
		return mfi[n];
	} else {
		return modinv(modfact(n));
	}
}
long long modbinom(int n, int k){
	if (n < 0 || k < 0 || k > n){
		return 0;
	} else {
		return modfact(n) * modfactinv(k) % MOD * modfactinv(n - k) % MOD;
	}
}
long long inversion_number(vector<int> &A){
	int N = A.size();
	vector<int> B = A;
	sort(B.begin(), B.end());
	map<int, int> mp;
	for (int i = 0; i < N; i++){
		mp[B[i]] = i + 1;
	}
	for (int i = 0; i < N; i++){
		A[i] = mp[A[i]];
	}
	long long ans = 0;
	vector<int> BIT(N + 1, 0);
	for (int i = 0; i < N; i++){
		ans += i;
		int j = A[i];
		while (j > 0){
			ans -= BIT[j];
			j -= j & -j;
		}
		j = A[i];
		while (j <= N){
			BIT[j]++;
			j += j & -j;
		}
	}
	return ans;
}
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  long long all = 1;
  for (int i = 1; i <= N; i++){
    all *= modbinom(N, i);
    all %= MOD;
  }
  long long E1 = 0;
  long long X = inversion_number(A);
  X %= MOD;
  for (int i = 2; i <= N; i++){
    long long p = modbinom(N - 2, i - 2) * modinv(modbinom(N, i)) % MOD;
    E1 += X * p;
    E1 %= MOD;
  }
  long long sum = 0;
  long long sqsum = 0;
  for (int i = 1; i <= N; i++){
    sum += i;
    sum %= MOD;
    sqsum += (long long) i * i;
    sqsum %= MOD;
  }
  long long half = modsub(sum * sum, sqsum) * modinv(2) % MOD;
  long long prob = half * modinv(N) % MOD * modinv(N) % MOD;
  map<int, int> mp;
  for (int i = 0; i < N; i++){
    mp[A[i]] += 1;
  }
  long long Y = (long long) N * (N - 1) / 2;
  for (auto P : mp){
    Y -= (long long) P.second * (P.second - 1) / 2;
  }
  Y %= MOD;
  long long E2 = prob * Y % MOD;
  cout << ((E1 + E2) % MOD) * all % MOD << endl;
}