#include<bits/stdc++.h>
#define N 3100
#define mod 998244353
#define int long long
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int f[N][N],g[N][N],C[N][N],cnt[N],n;
int add(int a,int b){return (a+b)%mod;}
int mul(int a,int b){return (a*b)%mod;}
signed main()
{
	n=read();
    for(int i=1,s;i<=n;i++)
    {
    	s=read();
        cnt[s]++;
    }
    C[0][0]=1;
    for(int i=1;i<=n;i++)
    {
        C[i][0]=1;
        for(int j=0;j<=i;j++)
        C[i][j]=add(C[i-1][j-1],C[i-1][j]);
    }
    for(int j=1;j<=n;j++)
    {
        g[0][j]=1;
        for(int i=j;i<=n;i+=j)
        g[i][j]=mul(g[i-j][j],C[i-1][j-1]);
    }
    f[n+1][0]=1;
    for(int i=n;i>=1;i--)for(int j=0;j<=n;j++)for(int k=0;k*i<=j+cnt[i];k++)
    f[i][j+cnt[i]-k*i]=add(f[i][j+cnt[i]-k*i],mul(f[i+1][j],mul(C[j+cnt[i]][k*i],g[k*i][i])));
    cout<<f[1][0]<<"\n";
    return 0;
}