#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
struct binary_indexed_tree{
  int N;
  vector<int> BIT;
  binary_indexed_tree(int N): N(N), BIT(N + 1, 0){
  }
  void add(int i){
    i++;
    while (i <= N){
      BIT[i]++;
      i += i & -i;
    }
  }
  int sum(int i){
    int ans = 0;
    while (i > 0){
      ans += BIT[i];
      i -= i & -i;
    }
    return ans;
  }
  int sum(int L, int R){
    return sum(R) - sum(L);
  }
};
int main(){
  int N;
  cin >> N;
  vector<int> P(N);
  for (int i = 0; i < N; i++){
    cin >> P[i];
    P[i]--;
  }
  vector<long long> inv(N + 1);
  inv[1] = 1;
  for (int i = 2; i <= N; i++){
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
  }
  vector<long long> fact(N + 1);
  vector<long long> finv(N + 1);
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= N; i++){
    fact[i] = fact[i - 1] * i % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
  vector<int> A(N), B(N);
  binary_indexed_tree BIT1(N);
  for (int i = 0; i < N; i++){
    A[i] = BIT1.sum(0, P[i]);
    B[i] = BIT1.sum(P[i] + 1, N);
    BIT1.add(P[i]);
  }
  vector<int> C(N), D(N);
  binary_indexed_tree BIT2(N);
  for (int i = N - 1; i >= 0; i--){
    C[i] = BIT2.sum(0, P[i]);
    D[i] = BIT2.sum(P[i] + 1, N);
    BIT2.add(P[i]);
  }
  long long ans = 0;
  for (int i = 0; i < N; i++){
    ans += fact[A[i] + D[i]] * finv[A[i]] % MOD * finv[D[i]] % MOD * fact[B[i] + C[i]] % MOD * finv[B[i]] % MOD * finv[C[i]] % MOD;
  }
  ans %= MOD;
  cout << ans << endl;
}