// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
 
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,cnt[15];
modint res;
modint f[maxn],g[maxn];

void prew()
{
	f[0]=1; int mx=0;
	For(i,1,12){
		Rep(j,mx,0){
			For(k,1,cnt[i])
				f[j+k*i]+=f[j];
		}
		mx+=cnt[i]*i;
	}
	For(i,0,mx){
		int t=i/10+1;
		res+=t*f[i];
	}
}

modint dp[4005][4005];
int lim[4005];
modint buc[maxn];
void sub()
{
	int V=cnt[11];
	int mxc=cnt[11];
	For(i,0,cnt[11]){
		dp[i][cnt[11]-i]=cnt[10]+1;
		lim[i]=cnt[11]-i;
	}
	int V2=cnt[11]+cnt[12]*2;
	//V2=inf;
	Rep(i,9,2){
		if(i&1){
			Rep(j,mxc,0){
				lim[j]=min(lim[j],V2);
				Rep(k,lim[j],0)if(dp[j][k].x){
					modint w=dp[j][k];
					For(l,1,cnt[i])
						dp[j+l][min(k+l*(10-i),V2)]+=w,
						lim[j+l]=max(lim[j+l],k+l*(10-i));
				}
			}
			mxc+=cnt[i];
		}else{
			Rep(j,mxc,0){
				lim[j]=min(lim[j],V2);
				Rep(k,lim[j],0)if(dp[j][k].x){
					modint w=dp[j][k];
					For(l,1,cnt[i])
						dp[j][min(k+l*(10-i),V2)]+=w;
				}
				lim[j]+=cnt[i]*(10-i);
			}
		}
	}
	//exit(0);
	For(i,0,mxc){
		For(j,0,lim[i]){
			if(dp[i][j].x){
				modint w=dp[i][j];
				int up1=j-cnt[11];
				ll sum=0;
				// add 1.
				For(k,0,cnt[1]){
					
					int up=0;
					if(k<=i) up+=9*k;
					else{
						if(k%2==i%2){
							up+=9*i;
							up+=8*((k-i)/2);
						}else{
							if(!i) up+=8*((k-i)/2);
							else up+=9*(i-1),up+=8*((k-i+1)/2);
						}
					}
					up+=up1;
					
					if(up>=cnt[12]*2) break;
					
					buc[up+cnt[11]]+=w;
					
				}
			}
		}
	}
	For(up,-cnt[11],cnt[12]*2){
		modint sum=0;
		For(l,0,cnt[12]){
			int tmp=up-2*l;
			if(tmp<0) sum+=(-tmp)/10;
		}
		res-=sum*buc[up+cnt[11]];
	}
}

signed main()
{
//	freopen("w5.in","r",stdin);
	n=read();
	For(i,1,n)cnt[read()]++;
//	For(i,1,12)cerr<<cnt[i]<<" ";cout<<"\n";
	prew();
//	cout<<res.x<<"\n";
	sub();
	cout<<res.x;
	return 0;
}
/*

*/