#include<iostream>
#include<cstdio>
#define N 12
#define M 20000
#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[M+1][K+1],F[M+1][K+1],ans;
int main()
{
	int x,res=0,res2=0,res3=0,d;
	n=read(),dp[0][0]=DP[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+(10-i)*cnt[i];++j)
			for (int k=0;k<=res3+((i&1)?cnt[i]:0);++k)
				F[j][k]=0;
		for (int j=0;j<=res2;++j)
			for (int k=0;k<=res3;++k)
				for (int t=0;t<=cnt[i];++t)
					Adder(F[j+(10-i)*t][k+((i&1)?t:0)],DP[j][k]);
		for (int j=0;j<=res2+(10-i)*cnt[i];++j)
			for (int k=0;k<=res3+((i&1)?cnt[i]:0);++k)
				DP[j][k]=F[j][k];
		res2+=(10-i)*cnt[i],res3+=((i&1)?cnt[i]:0);
	}
	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)
			for (int k=0;k<=res2;++k)
				for (int t=(k&1);t<=min(k,res3);t+=2)
				{
					d=max((i+(j<<1)-k)/10,(j-((k-t)>>1)+5)/10);
					if (d>=1) Adder2(ans,-1ll*DP[k][t]*d%mod);
				}
	printf("%d\n",ans);
	return 0;
}