#include<bits/stdc++.h>
using namespace std;
const int mxn=45;
const int mod=998244353;
int n,m,iv[mxn],i,j,t,k,s,a[mxn];
struct poly
{
	int e[mxn];
	inline void clr(){memset(e,0,sizeof(e));}
	inline void init(int x)
	{
		int nw=1;
		for (int i=0;i<=n;++i,nw=nw*1ll*(x-i+1)%mod*iv[i]%mod)
		{
			e[i]=nw;
		}
	}
	const poly operator * (const poly x) const
	{
		poly ret;
		ret.clr();
		for (int i=0;i<=n;++i)
		 for (int j=0;j+i<=n;++j)
		  ret.e[i+j]=(ret.e[i+j]+e[i]*1ll*x.e[j])%mod;
		return ret;
	}
}b[mxn],ans;

int main()
{
	iv[0]=iv[1]=1;
	for (i=2;i<mxn;++i) iv[i]=iv[mod%i]*1ll*(mod-mod/i)%mod;
	scanf("%d",&n);t=0;
	ans.e[0]=1;
	for (i=1;i<=n;++i) scanf("%d",&a[i]),b[i].init(a[i]),ans=ans*b[i],t+=a[i]-1;
	s=ans.e[n-1];
	for (i=1;i<n;++i) s=1ll*s*i%mod;
	for (i=1;i<=t;++i) s=1ll*s*i%mod;
	printf("%d\n",s);
	return 0;
}