#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define int long long
const int mod = 998244353;
using namespace std;
int n, val[105], m, f[105][105][105], jie[5005], inv[5005];
inline int ksm(int p, int q = mod - 2) {
	int base = 1;
	while (q) {
		if (q & 1) base = base * p % mod;
		q >>= 1;
		p = p * p % mod;
	}
	return base;
}
inline int C(int p, int q) {
	if (p < 0 || q < 0 || p < q) return 0;
	return jie[p] * inv[q] % mod * inv[p - q] % mod;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	jie[0] = inv[0] = 1;
	for (int i = 1; i <= 5000; i++) {
		jie[i] = jie[i - 1] * i % mod;
		inv[i] = ksm(jie[i]);
	}
	cin >> n;
	int p;
	for (int i = 1; i <= n; i++) {
		cin >> p;
		val[p]++;
	}
	for (int i = 1; i <= 100; i++) {
		if (val[i]) val[++m] = val[i];
	}
	f[0][0][0] = 1;
	int ans = 0;
	for (int i = 1; i <= m; i++) {
		for (int j = 0; j <= i; j++) {//选了多少
			for (int k = 0; k <= m; k++) { //覆盖了多少,定义为第一次出现到最后一次附加的段数
				f[i][j][k] = f[i - 1][j][k];
				if (j) {
					for (int p = 1; p <= k; p++) {
						if (p == 1)f[i][j][k] = (f[i][j][k] + f[i - 1][j - 1][k - 1]  * j % mod) % mod;
						else f[i][j][k] = (f[i][j][k] + f[i - 1][j - 1][k - p] * C(val[i] + p - 3, p - 1) % mod * j % mod) % mod;
					}
				}
			}
		}
	}
	ans = 0;
	for (int i = 1; i <= m; i++) {
		ans = (ans + f[m][i][m] * jie[m - i] % mod) % mod;
	}
	for (int i = 1; i <= m; i++) ans = ans * jie[val[i]] % mod;
	cout << ans;
}