#include <cstdio>
#include <algorithm>
const int Maxn=100;
const int Mod=998244353;
int n;
int a[Maxn+5];
int f[Maxn+5][Maxn+5][Maxn+5];
int find_last(int n){
	static int g[Maxn+5];
	g[n]=1;
	int ans=0;
	for(int i=n;i>0;i--){
		int use=std::min(g[i],a[i]);
		g[i-1]=std::min(g[i]*2-use,10000);
		ans-=a[i]-use;
	}
	ans+=g[0]-a[0];
	return ans;
}
int main(){
	scanf("%d",&n);
	int mn_val=Maxn;
	for(int i=1;i<=n;i++){
		int x;
		scanf("%d",&x);
		mn_val=std::min(mn_val,x);
		a[x]++;
	}
	f[Maxn+1][0][0]=1;
	int ans=0;
	for(int i=Maxn;i>=0;i--){
		int require=find_last(i-1);
		for(int j=0;j<=n;j++){
			for(int k=0;k<=n;k++){
				if(f[i+1][j][k]==0){
					continue;
				}
				for(int t=0;t<=n;t++){
					int use=std::min(j+t,a[i]);
					int nxt_j=2*j+t-use,nxt_k=k+a[i]-use;
					if(i==0&&nxt_j>0&&j+t<=a[i]+k){
						ans=(ans+f[i+1][j][k])%Mod;
					}
					if(nxt_j<0||nxt_j>n||nxt_k<0||nxt_k>n){
						continue;
					}
					if((nxt_k!=0||mn_val!=i)&&nxt_j==0&&nxt_k+1>=require&&t>0){
						ans=(ans+f[i+1][j][k])%Mod;
					}
					if(i>0){
						f[i][nxt_j][nxt_k]=(f[i][nxt_j][nxt_k]+f[i+1][j][k])%Mod;
					}
				}
			}
		}
	}
	printf("%d\n",(ans+1)%Mod);
	return 0;
}