// Problem: No.2616 中央番目の中央値
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2616
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include<bits/stdc++.h>
#define debug(x) cerr<<(#x)<<" "<<(x)<<endl
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe; 
ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=1e6+9,Mod=998244353;
ll n,a[N],pre[N],suf[N],bit[N],fac[N],ifac[N],ans;
ll pw(ll x,ll p){
	ll res=1;
	while(p){
		if(p&1)res=res*x%Mod;
		x=x*x%Mod;
		p>>=1;
	}
	return res;
}
void Upd(ll x){
	while(x<=n)bit[x]++,x+=(x&(-x));
}
ll Query(ll x){
	ll res=0;
	while(x)res+=bit[x],x-=(x&(-x));
	return res;
}
ll C(ll x,ll y){
	if(x<y||y<0)return 0;
	return fac[x]*ifac[y]%Mod*ifac[x-y]%Mod;
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read();
	rep(i,1,n)a[i]=read();
	fac[0]=1;
	rep(i,1,n)fac[i]=fac[i-1]*i%Mod;
	ifac[n]=pw(fac[n],Mod-2);
	per(i,n-1,0)ifac[i]=ifac[i+1]*(i+1)%Mod;
	rep(i,1,n){
		pre[i]=Query(a[i]);
		Upd(a[i]);
	}
	memset(bit,0,sizeof(bit));
	per(i,n,1){
		suf[i]=Query(a[i]);
		Upd(a[i]);
	}
	rep(i,1,n){
		ll x=pre[i],y=suf[i];
		ans=(ans+C(n-i-y+x,x)*C(i-1-x+y,y))%Mod;
	}
	write(ans);
	return 0;
}