#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353;
int cnt[105];
int C[5205][5205];
int tt[105][105];
int dp[105][105][105];
int n,m;int a[5006],jie[5205];
signed main(){
	cin >> n;for(int i = 1;i<=n;i++)cin >> a[i];
	C[0][0] =C[1][0] = C[1][1] = 1;
	for(int i = 2;i<=5200;i++){
		C[i][0] = 1;
		for(int j = 1;j<=i;j++)C[i][j] = (C[i-1][j-1]+C[i-1][j])%mod;
	}//cout << C[6][3] << endl;
	jie[0] = 1;for(int i = 1;i<=5200;i++)jie[i] = jie[i-1]*i%mod;
	vector<int>p;for(int i = 1;i<=n;i++)p.push_back(a[i]);sort(p.begin(),p.end());
	p.erase(unique(p.begin(),p.end()),p.end());m = p.size();
	for(int i = 1;i<=n;i++)a[i] = lower_bound(p.begin(),p.end(),a[i])-p.begin()+1;
	//for(int i = 1;i<=n;i++)cout << a[i] << " ";cout << endl;
	for(int i = 1;i<=n;i++)cnt[a[i]]++; 
	for(int i = 1;i<=m;i++){
		for(int j =1;j<m;j++){
			tt[i][j+1] = C[cnt[i]+j-1][j]-1;
		}
	}//cout << tt[1][4] << endl;
	dp[0][0][0] = 1;dp[1][0][0] = 1;
	for(int i = 1;i<=m;i++){
		for(int j = 0;j<=m;j++){
			for(int k = 1;k<=i;k++){
				for(int y = 2;y<=j;y++){
					dp[i][j][k] = (dp[i-1][j-y][k-1]*tt[i][y]+dp[i][j][k])%mod;
				}
			}
		}memcpy(dp[i+1],dp[i],sizeof(dp[i]));
	}int ans =0;
	for(int k = 0;k<=m;k++)for(int j =0;j<=m;j++){
		ans = (ans+dp[m][j][k]*jie[k]%mod*jie[m-k]%mod)%mod;
	}//cout << ans << endl;
	for(int i = 1;i<=m;i++)ans = ans*jie[cnt[i]]%mod;
	cout << ans << endl;
	return 0;
}/* 
循环里面 y 打成 j 意外的能过一堆手造的小样例
调了一个多小时。 
*/