#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define ll long long
using namespace std;
const ll mod = 998244353;
ll n,x,a[2005],fac[2005],dv[2005],dp[2005][2005];
ll ksm(ll a,ll b,ll p)
{
	ll ret = 1;a %= p;
	while(b)
	{
		if(b & 1)
		    ret = ret * a % p;
		a = a * a % p,b >>= 1;
	}
	return ret;
}
void init()
{
	fac[0] = dv[0] = 1;
	for(ll i = 1;i <= 2001;i++)
	    fac[i] = fac[i - 1] * i % mod;
	dv[2001] = ksm(fac[2001],mod - 2,mod);
	for(ll i = 2000;i > 0;i--)
	    dv[i] = dv[i + 1] * (i + 1) % mod;
}
ll C(ll a,ll b)
{
	if(a < b)
	    return 0;
	return fac[a] * dv[b] % mod * dv[a - b] % mod;
}
ll solve(ll cur,ll val)
{
	if(cur == 1)
	    return 1;
	if(dp[cur][val])
	    return dp[cur][val];
	ll cnt = 1;
	for(ll i = 0;i * cur <= val;i++)
	{
		dp[cur][val] = (dp[cur][val] + solve(cur - 1,val - i * cur + a[cur - 1]) * cnt % mod * dv[i] % mod) % mod;
		cnt = cnt * C(val - i * cur,cur) % mod;
	}
	return dp[cur][val];
}
int main()
{
	scanf("%lld",&n),init();
	for(ll i = 1;i <= n;i++)
	    scanf("%lld",&x),a[x]++;
	printf("%lld",solve(n,a[n]));
    return 0;
}