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

const int MAXN = 100+5;
const ll mod = 998244353;
int n, s;
int a[MAXN];
ll ans = 0, fac[MAXN];
ll dp[MAXN][MAXN*MAXN];

int main(){
    cin >> n;
    fac[0] = 1;
    for(int i = 1; i <= n; i++){
        fac[i] = fac[i-1]*i%mod;
    }
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        s += a[i];
    }
    if(s & 1){
        cout << "0\n";
        return 0;
    }
    s /= 2;
    dp[0][0] = 1;
    for(int i = 1; i <= n; i++){
        for(int j = i; j >= 1; j--){
            for(int k = 0; k <= 100*j; k++){
                dp[j][k] = (dp[j][k] + dp[j-1][k-a[i]]) % mod;
            }
        }
    }
    for(int i = 1; i < n; i++){
        ans = (ans + dp[i][s]*fac[i]%mod*fac[n-i]%mod);
    }
    cout << ans%mod << "\n";
    return 0;
}