#include<iostream>
using namespace std;
#define int long long
int n,m;
int a[500010],c[500010];
const int mod=998244353;
int lowbit(int x){
	return x&-x;
}
void add(int x,int v){
	while(x<=n){
		c[x]+=v;
		x+=lowbit(x);
	}
}
int query(int x){
	int cnt=0;
	while(x){
		cnt+=c[x];
		x-=lowbit(x);
	}
	return cnt;
}
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	int ans=0,base=1;	
	for(int i=n;i>=1;i--){
		add(a[i],1);
		ans=(ans+(query(a[i]-1)*base)%mod)%mod;
		base=base*(n-i+1)%mod;
	}
	cout<<(ans+1)%mod<<endl;
	return 0;
}