#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int MOD=998244353;
namespace Lib {
struct BIT {
  vector<ll> a;
  int sz;
  BIT(int n) : sz(n), a(n + 1) {}
  void add(int p, int v) {
    for (p += 1; p <= sz; p += p & -p) a[p] += v;
  }
  ll sum(int l, int r) {
    ll ret = 0;
    for (; r > 0; r -= r & -r) ret += a[r];
    for (; l > 0; l -= l & -l) ret -= a[l];
    return ret;
  }
};
}  // namespace Lib
namespace Lib{
  struct mod_fac{
    vector <ll> fac,inv,invf;
    mod_fac (int n):
      fac(n),inv(n),invf(n){
      fac[0]=fac[1]=1;
      inv[0]=inv[1]=1;
      invf[0]=invf[1]=1;
      for(int i=2;i<n;i++){
        fac[i]=fac[i-1]*i%MOD;
        inv[i]=inv[MOD%i]*(MOD-MOD/i)%MOD;
        invf[i]=invf[i-1]*inv[i]%MOD;
      }
    }
    ll comb(int n,int r){
      if(n<r)return 0ll;
      return fac[n]*invf[r]%MOD*invf[n-r]%MOD;
    }
    ll perm(int n,int r){
      if(n<r)return 0ll;
      return fac[n]*invf[n-r]%MOD;
    }
  };
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin>>N;
  vector P(N,0);
  for(int i=0;i<N;i++){
    int t;
    cin>>t;
    P[t-1]=i;
  }
  Lib::mod_fac F(N+1);
  Lib::BIT BIT(N);
  ll ans=0ll;
  for(int i=0;i<N;i++){
    int S=BIT.sum(0,P[i]);
    ans=(ans+F.comb(S+(N-1-P[i]-(i-S)),S)*F.comb((P[i]-S)+(i-S),P[i]-S))%MOD;
    BIT.add(P[i],1);
  }
  cout<<ans<<'\n';
}