#include<bits/stdc++.h>
using namespace std;
int n,a[1100000],b[1100000];
long long hh[1100000],ans;
const int mod=998244353;
int main(){
	scanf("%d",&n);
	hh[0]=1;
	for(int i=1;i<=n;i++)
	    hh[i]=hh[i-1]*i%mod;
	for(int i=1;i<=n;i++)
	    scanf("%d",&a[i]);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)
		if(a[i]>a[j])b[i]++;
	    ans=(ans+(b[i]*hh[n-i])%mod)%mod;
	}
	cout<<(ans+1)%mod<<endl;
	return 0;
}