#include<bits/stdc++.h>
using namespace std;
const int N=1e2;
const int mod=998244353;
void inc(int &x,int y){ if((x+=y)>=mod) x-=mod; }
int n;
int f[N+5][N+5][N+5];
int c[N+5],mn=N+1;
int g[N+5];
int use(int x){
	if(!x) return 0;
	int s=0;
	g[x-1]=1;
	for(int i=x-1;i;i--){
		if(c[i]>=g[i]) s+=c[i]-g[i];
		g[i-1]=min(n+1,max(g[i],2*g[i]-c[i]));
	}
	return g[0]-c[0]-s;
}
int main(){
	scanf("%d",&n);
	for(int i=1,x;i<=n;i++){
		scanf("%d",&x);
		if(x==1) x=0;
		c[x]++; mn=min(mn,x);
	}
	int ans=0;
	f[N+1][0][0]=1;
	for(int i=N;i>=0;i--){
		int tu=use(i);
		for(int j=0;j*(i+1)<=n;j++)
			for(int k=0;k<=n;k++){
				if(!f[i+1][j][k]) continue;
				for(int t=0;t<=n;t++){
					int tj=max(j,j*2+t-c[i]),tk=k+max(0,c[i]-j-t);
					if(!i&&tj>0&&c[i]+k>=j+t) inc(ans,f[i+1][j][k]);
					if((i!=mn||tk>0)&&!tj&&t>0&&tk+1>=tu) inc(ans,f[i+1][j][k]);
					if(i&&tj<=n) inc(f[i][tj][tk],f[i+1][j][k]);
				}
			}
	}
	printf("%d\n",(ans+1)%mod);
	return 0;
}