#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 12
#define K 2000
#define M 24000
#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;
}
struct reads
{
	int x,y,d;
	bool operator < (const reads &t)const
    {
 		return y!=t.y?y>t.y:x>t.x;	
	}
};
reads tong[N+1];
int n,length,cnt[N+1],dp[N+1][M+1],DP[N+1][M+1],DSP[K+1][K+1],G[K+1][K+1],F[M+1],ans;
int main()
{
	int x,res=0,res2=0,res3=0,res4=0,d1,d2,ds1,ds2;
	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=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=1;i<=12;++i)
		if (i!=10)
		{
			if (i==1) d1=1,d2=-2;
			else if (2<=i&&i<=9)
			{
				if (i&1) d1=-1,d2=-3-((10-i)>>1);
				else d1=0,d2=-((10-i)>>1);
			}
			else if (i==11) d1=-1,d2=-2;
			else d1=0,d2=1;
			tong[++length]=(reads){d1,d2,cnt[i]};
		}
	sort(tong+1,tong+length+1);
	for (int i=1;i<=length;++i)
	{
		if (tong[i].x>0)
		{
			for (int j=0;j<=res3+tong[i].x*tong[i].d;++j)
				for (int k=0;k<=res4;++k)
					G[j][k]=0;
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4;++k)
				{
					Adder(G[j][k],DSP[j][k]);
					if (j+tong[i].x<=res3&&k+tong[i].y*(tong[i].d+1)>=0) Adder2(G[j+tong[i].x*(tong[i].d+1)][k+tong[i].y*(tong[i].d+1)],-DSP[j][k]);
				}
			res3+=tong[i].x*tong[i].d;
			for (int j=tong[i].x;j<=res3;++j)
				for (int k=res4+tong[i].y;k>=0;--k)
					Adder(G[j][k],G[j-tong[i].x][k-tong[i].y]);
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4;++k)
					DSP[j][k]=G[j][k];
		}
		else if (tong[i].y>0)
		{
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4+tong[i].y*tong[i].d;++k)
					G[j][k]=0;
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4;++k)
				{
					Adder(G[j][k],DSP[j][k]);
					if (j+tong[i].x*(tong[i].d+1)>=0&&k+tong[i].y<=res4) Adder2(G[j+tong[i].x*(tong[i].d+1)][k+tong[i].y*(tong[i].d+1)],-DSP[j][k]);
				}
			res4+=tong[i].y*tong[i].d;
			for (int j=res3+tong[i].x;j>=0;--j)
				for (int k=tong[i].y;k<=res4;++k)
					Adder(G[j][k],G[j-tong[i].x][k-tong[i].y]);
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4;++k)
					DSP[j][k]=G[j][k];
		}
		else
		{
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4;++k)
					G[j][k]=0;
			for (int j=0;j<=res3;++j)
				for (int k=0;k<=res4;++k)
				{
					Adder(G[j][k],DSP[j][k]);
					if (j+tong[i].x*(tong[i].d+1)>=0&&k+tong[i].y*(tong[i].d+1)>=0) Adder2(G[j+tong[i].x*(tong[i].d+1)][k+tong[i].y*(tong[i].d+1)],-DSP[j][k]);
				}
			for (int j=res3+tong[i].x;j>=0;--j)
				for (int k=res4+tong[i].y;k>=0;--k)
					Adder(G[j][k],G[j-tong[i].x][k-tong[i].y]);
			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<=res3;++i)
		for (int j=0;j<=res4;++j)
		{
			if (DSP[i][j]&&min((i+1)>>1,(j+((i&1)<<1))/5)) cerr<<i<<','<<j<<':'<<DSP[i][j]<<endl;
			Adder2(ans,-1ll*DSP[i][j]*min((i+1)>>1,(j+((i&1)<<1))/5)%mod*(cnt[10]+1)%mod);
		}
	printf("%d\n",ans);
	return 0;
}