#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

constexpr int mod = 998244353;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; i++) {
        fac[i] = fac[i - 1] * i % mod;
        inv[i] = mod - inv[mod % i] * (mod / i) % mod;
        finv[i] = finv[i - 1] * inv[i] % mod;
    }
}

long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}

long long choose(int n,int k) {
    if(n < 0 || k < 0) return 0;
    if(n == 0) return 1;
    return COM(n+k-1,k-1);
}

void mpl(int &x,int y) {
    x += y;
    if(x >= mod) x -= mod;
}

int dp[550][550];

int main() {
    COMinit();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int>a(n);//,b;
    for(int i = 0; i < n; i++) {
        cin >> a[i];/*
        for(int j = 0; j < a[i]; j++) {
            b.push_back(i);
        }*/
    }/*
    int fans = 0;
    do {
        int x = 0,y = 0;
        bool f = true;
        for(int j = 0; j < b.size(); j++) {
            if(b[j] < x && b[j] < y) {
                f = false;
                break;
            }
            if(y <= b[j]) {
                y = b[j];
            }
            else {
                x = b[j];
                if(x > y) swap(x,y);
            }
        }
        if(f) {
            fans++;
        }
    }while(next_permutation(b.begin(),b.end()));
    cout << fans << endl;*/
    dp[0][0] = 1;
    int res = 0;
    for(int i = 0; i < n; i++) {
        vector<int>tmp(1000);
        for(int j = 0; j <= res; j++) {
            for(int k = 0; k <= a[i]; k++) {
                int nxt = 500+a[i]-k-j;
                if(choose(j,k)) mpl(tmp[nxt],choose(j,k));
            }
            for(int k = 0; k <= 1000; k++) {
                if(!tmp[k] || !dp[i][j]) continue;
                int nxt = j+k-500;
                mpl(dp[i+1][nxt],1ll*dp[i][j]*tmp[k]%mod);
            }
        }
        res += a[i];
    }
    cout << dp[n][0] << "\n";
}