#include<iostream>
#include<cstdio>
#define N 12
#define M 24000
#define K 2000
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,cnt[N+1],dp[N+1][M+1],DP[N+1][M+1],DSP[K+1][M+1],G[K+1][M+1],F[M+1],ans;
int main()
{
	int x,res=0,res2=0,res3=0,res4=0,d;
	n=read(),dp[0][0]=DP[0][0]=DSP[0][0]=1;
	for (int i=1;i<=n;++i) x=read(),cnt[x]++;
	for (int i=1;i<=12;++i)
	{
		for (int j=0;j<=res;++j)
	   	    for (int k=0;k<=cnt[i];++k)
				Adder(dp[i][j+i*k],dp[i-1][j]);
		res+=i*cnt[i];
	}
	for (int i=1;i<=10;++i)
	{
		for (int j=0;j<=res2;++j)
	   	    for (int k=0;k<=cnt[i];++k)
				Adder(DP[i][j+(10-i)*k],DP[i-1][j]);
		res2+=(10-i)*cnt[i];
	}
	for (int i=2;i<=10;++i)
	{
		d=((i&1)?(5+((10-i)>>1)):((10-i)>>1));
		for (int j=0;j<=res3+((i&1)?cnt[i]:0);++j)
			for (int k=0;k<=res4+d*cnt[i];++k)
				G[j][k]=0;
		for (int j=0;j<=res3;++j)
			for (int k=0;k<=res4;++k)
				for (int t=0;t<=cnt[i];++t)
					Adder(G[j+((i&1)?t:0)][k+d*t],DSP[j][k]);
		res3+=((i&1)?cnt[i]:0),res4+=d*cnt[i];
		for (int j=0;j<=res3;++j)
			for (int k=0;k<=res4;++k)
				DSP[j][k]=G[j][k];
	}
	for (int i=0;i<=res;++i) Adder(ans,1ll*dp[12][i]*(i/10+1)%mod);
	for (int i=0;i<=cnt[11];++i)
		for (int j=0;j<=cnt[12];++j)
			F[i+(j<<1)]++;
	for (int i=0;i<=cnt[11]+(cnt[12]<<1);++i)
		for (int j=0;j<i;++j)
			Adder2(ans,-1ll*F[i]*DP[10][j]%mod*((i-j)/10)%mod);
	for (int i=0;i<=cnt[1];++i)
		for (int j=0;j<=min(i-1,cnt[11]);++j)
			for (int t=0;t<=min(res3,i-j-1);++t)
				for (int s=0;s<=res4;++s)
				{
					d=(((i+j-t)>>1)<<2)+5+s;
					for (int k=d;k<=cnt[12];++k) Adder2(ans,-1ll*DSP[t][s]*min((k-d)/5+1,(i-j-t+1)>>1)%mod);
				}
	printf("%d\n",ans);
	return 0;
}