#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-9;
const int N=1007;
int n,m;
int a[N];
long long f[N], g[N],inv[N];
int sum[N];
int dp[N][N];
long long p = 998244353;
long long qpow(long long a, long long n)
{
    long long result = 1;
    while (n > 0)
    {
        if (n & 1)
        {
            result = result * a % p;
        }
        a = a * a % p;
        n >>= 1;
    }
    return result % p;
}
void init()
{
	int n=1000;
    f[0] = g[0] = 1;
    inv[1]=inv[0]=1;
    //for(int i=2;i<=n;i++){
        //inv[i]=inv[p%i]*(p-p/i)%p;//线性筛求逆元
    //}
    for (int i = 1; i <= n; i++)
    {
        f[i] = f[i - 1] * i % p;
    }
    g[n-1]=qpow(f[n-1],p-2);
    for(int i=n-2;i>=0;i--){
        g[i]=g[i+1]*(i+1)%p;
    }
}
long long C(long long n, long long m)
{
    return (f[n] * g[m]) % p * g[n - m] % p;
}
void solve(){
	cin>>n;
	init();
	for(int i=1;i<=n;i++){
        cin>>a[i];
		sum[i]=sum[i-1]+a[i];
    }
	dp[0][0]=1;
    for(int i=0;i<n;i++){
		for(int j=0;j<=sum[i];j++){
			if(dp[i][j]){
				dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
				for(int k=j+1;k<sum[i+1];k++){
					int lb=max(0ll,a[i+1]-(k-j));
					int ub=min(a[i+1]-1,sum[i+1]-k-1);
					for(int x=lb;x<=ub;x++){
						dp[i+1][k]=(dp[i+1][k]+dp[i][j]*C(k-j-1,a[i+1]-x-1)%mod)%mod;
					}
				}
			}
		}
	}
	int ans=0;
	for(int i=0;i<sum[n];i++){
		ans=(ans+dp[n][i])%mod;
	}
	cout<<ans<<endl;
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
}