#include<bits/stdc++.h>

#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second

using ll = long long;
using lf = long double;


using namespace std;
const ll mod = 998244353;
ll n;
ll arr[200];
ll mem[10001][101][2];
ll sume(ll &a, ll b){
    if(a + b < mod)return a + b;
    return (a + b) % mod;
}
ll calc_dp(ll suma, ll taken, ll pos, int other){
    if(suma == 0 && taken == 0)return 1;
    if(suma == 0 || taken == 0)return 0;
    if(suma < 0)return 0;
    if(pos == n){
        return 0;
    }
    return sume(mem[suma][taken][other], (suma - arr[pos] >= 0   ?  mem[suma - arr[pos]][taken-1][other] : 0 ) );
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    #ifdef LOCAL
    freopen("in", "r", stdin);
    #endif
    cin >> n;
    ll fact[n+1];
    fact[0] = 1;
    for(ll i = 1 ; i <= n ; i ++)fact[i] = fact[i-1] * i % mod;
    ll sum = 0;
    memset(mem, -1, sizeof mem);
    for(int i = 0 ; i < n ; i++){
        cin >> arr[i];
        sum += arr[i];
    }
    if(sum % 2 != 0){
        cout << 0 << endl;
        return 0;
    }
    int cur = 0;
    int mitad = sum / 2;
    for(int i = n ; i >= 0 ; i -- ){
        for(int s = 0 ; s <= mitad ; s ++){
            for(int taken = 0 ; taken <= n ; taken ++){
                mem[s][taken][cur] = calc_dp(s, taken, i, 1 - cur);
            }
        }
        cur = 1 - cur;
    }
    cur = 1 - cur;
    ll ans = 0;
    for(int taken = 0 ;taken <= n ; taken ++){
        //cout << "ways " << taken << " " << mem[mitad][taken][cur] << endl;
        if(mem[mitad][taken][cur])ans = (ans + mem[mitad][taken][cur] * fact[taken] % mod * fact[n-taken] % mod) % mod;
    }
    cout << ans << "\n";

    
    return 0;
}