#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
template<class T> struct fenwick_tree{
    vector<T> v;
    int n;
    fenwick_tree(int x){
        n=x;
        v.assign(n+1,0);
    }
    fenwick_tree(vector<T> &a){
        n=(int)a.size();
        v.assign(n+1,0);
        for(int i=0;i<n;i++) v[i+1]=a[i];
        for(int idx=1;idx<=n;idx++){
            if(n<idx+(idx&(-idx))) continue;
            v[idx+(idx&(-idx))]+=v[idx];
        }
    }
    void add(int i,T x){
        assert(0<=i&&i<n);
        i++;
        for(int idx=i;idx<=n;idx+=(idx&(-idx))){
            v[idx]+=x;
        }
    }
    T sum(int r){  //[0,r]
        r++;
        T ret=0;
        for(int idx=r;0<idx;idx-=(idx&(-idx))){
            ret+=v[idx];
        }
        return ret;
    }
    T sum(int l,int r){  //[l,r]
        assert(0<=l&&l<n);
        assert(0<=r&&r<n);
        assert(l<=r);
        if(l==0) return sum(r);
        return sum(r)-sum(l-1);
    }
    int lower_bound(T w){
        if(w<=0) return 0;
        int x=0;
        static int r=1;
        if(r==1){
            while((r<<1)<=n) r<<=1;
        }
        while((r<<1)<=n) r<<=1;
        for(int k=r;0<k;k>>=1){
            if(x+k<=n&&v[x+k]<w){
                w-=v[x+k];
                x+=k;
            }
        }
        return x;
    }
};
const ll mod=998244353;
ll modpow(ll a,ll b){
    if(mod==1) return 0;
    if(b==0) return 1;
    ll ret=1;
    a%=mod;
    while(0<b){
        if(b&1) ret=ret*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ret;
}
ll division(ll a,ll b){
    return (a*modpow(b,mod-2))%mod;
}
vector<ll> factorial;
ll nCr(ll n,ll r){
    if(n<0||r<0) return 0;
    if(n<r) return 0;
    if((ll)factorial.size()==0){
        ll mx=600001;  //mx(上限)は適宜変更
        factorial.resize(mx+1,0);
        ll x=1;
        factorial[0]=1;
        for(ll i=1;i<=mx;i++){
            x*=i;
            x%=mod;
            factorial[i]=x;
        }
    }
    return division(factorial[n],factorial[r]*factorial[n-r]);
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;
    cin >> n;
    vector<ll> p(n);
    rep(i,n){
        cin >> p[i];
        p[i]--;
    }
    vector<ll> v(n,1);
    fenwick_tree<ll> f(n),b(v);
    ll ans=0;
    rep(i,n){
        b.add(p[i],-1);
        ll fmin=f.sum(p[i]),fmax=f.sum(p[i],n-1);
        ll bmin=b.sum(p[i]),bmax=b.sum(p[i],n-1);
        f.add(p[i],1);
        ans+=nCr(fmin+bmax,fmin)*nCr(fmax+bmin,fmax)%mod;
        ans%=mod;
    }
    cout << ans << '\n';
}