#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
#define pb push_back
#define fs first
#define sn second
#define ms(a, x) memset(a, x, sizeof(a))
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
const int INF = 0x3f3f3f3f;
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x){cerr << #x << ' ' << (x) << endl;}
#define dbgArr(arr, n){cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <class T, class U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const int MOD = 998244353;
const int MN = 105;
const int MW = 1e4 + 5;
int n;
int arr[MN];
int dp[MN][MW];
int fact[MN];

int main(){
    fact[0] = 1;
    FOR(i, 1, MN) fact[i] = (ll) fact[i-1]*i % MOD;

    cin.sync_with_stdio(0); cin.tie(0);
    cin >> n;
    FR(i, n) cin >> arr[i];
    dp[0][0] = 1;
    FR(i, n){
        FORR(lvl, i+1, 1) FORR(j, MW-1, arr[i]){
            dp[lvl][j] += dp[lvl-1][j-arr[i]];
            if(dp[lvl][j] >= MOD) dp[lvl][j] -= MOD;
        }
    }

    int sm = accumulate(arr, arr+n, 0);
    dbg(sm);
    if(sm & 1) return !printf("0\n");
    
    ll ans = 0;
    FR(lvl, n+1){
        ans += (ll) dp[lvl][sm/2] * fact[lvl] % MOD * fact[n-lvl] % MOD;
    }
    cout << ans % MOD << '\n';
}