#include <iostream>
#include <atcoder/fenwicktree>
#define int long long
using namespace std;
using namespace atcoder;

//参考: https://drken1215.hatenablog.com/entry/2018/06/08/210000
const int mod = 998244353;
int fact[300001], inv[300001], finv[300001];
void comb_init(int n) {
	fact[0] = fact[1] = finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i <= n; i++) {
		fact[i] = fact[i - 1] * i % mod;
		inv[i] = (mod - inv[mod % i] * (mod / i) % mod) % mod;
		finv[i] = finv[i - 1] * inv[i] % mod;
	}
}

int comb(int n, int k) {
	return fact[n] * finv[k] % mod * finv[n - k] % mod;
}

int n;
int p[300000];

signed main() {
	int i;
	
	cin >> n;
	comb_init(n);
	for (i = 0; i < n; i++) { cin >> p[i]; p[i]--; }
	
	fenwick_tree<int> fwL(n), fwR(n);
	vector<int> A(n), B(n), C(n), D(n);
	for (i = 0; i < n; i++) { //p[i]より左の要素について、p[i]未満・p[i]超えの個数をカウント
		A[i] = fwL.sum(0, p[i]);	//値が[0, p[i])に含まれる要素数
		B[i] = i - A[i];
		fwL.add(p[i], 1);
	}
	
	for (i = n - 1; i >= 0; i--) { //p[i]より右の要素について、p[i]未満・p[i]超えの個数をカウント
		C[i] = fwR.sum(0, p[i]);	//値が[0, p[i])に含まれる要素数
		D[i] = (n - 1 - i) - C[i];
		fwR.add(p[i], 1);
	}
	
	int ans = 0;
	for (i = 0; i < n; i++) {
		int res = comb(A[i] + D[i], A[i]) * comb(B[i] + C[i], B[i]) % mod;
		ans += res;
		ans %= mod;
	}
	
	cout << ans << endl;
	return 0;
}