#include<bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int mod = 998244353;
const int N = 2005;
int n;
int cnt[N];
int sum[N];
ll f[N][N], fac[N], inv[N];

ll ksm(ll a, int b) {
	ll ans = 1;
	for (; b; b >>= 1, a = a * a % mod) {
		if (b & 1) ans = ans * a % mod;
	}
	return ans;
}

ll C(int n, int m) {
	if (n < m) return 0;
	return fac[n] * inv[m] % mod * inv[n - m] % mod;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1, w; i <= n; i++) cin >> w, cnt[w]++;
	for (int i = n; i >= 1; i--) sum[i] = sum[i + 1] + cnt[i]; 
	fac[0] = 1;
	for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % mod;
	inv[n] = ksm(fac[n], mod - 2);
	for (int i = n; i >= 1; i--) inv[i - 1] = inv[i] * i % mod;
	f[n + 1][0] = 1;
	for (int i = n; i >= 1; i--) {
		for (int j = 0; j <= sum[i + 1]; j++) {
			if (!f[i + 1][j]) continue;
			int nc = j + cnt[i];
			f[i][nc] = (f[i][nc] + f[i + 1][j]) % mod;
			ll pw = 1;
			for (int k = 1; k * i <= nc; k++) {
				pw = pw * C(nc - (k - 1) * i, i) % mod;
				f[i][nc - k * i] = (f[i][nc - k * i] + pw * f[i + 1][j] % mod * inv[k] % mod) % mod;
			}
		}
	}
	cout << f[1][0];
	QwQ330AwA;
}