#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define trav(a, x) for(auto& a : x)
#define FOR(i, a, b) for (int i=(a); i<=(signed)(b); i++)
#define ROF(i, a, b) for (int i=(a); i>=(signed)(b); i--)
#define F0R(i, a) for (int i=0; i<(signed)(a); i++)
#define vi vector<int>
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
typedef long long ll;

const ll mod = 998244353;

using pii = pair<int, ll>;

ll dp[101][10005];

int main() 
{	
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<ll> a(n);
    ll sm = 0;
    F0R(i, n) {
        cin >> a[i];
        sm += a[i];
    }
    if(sm%2) {
        cout << 0 << "\n";
        return 0;
    }
    dp[0][0] = 1; 
    F0R(i, n) {
        ROF(len, n-1, 0) FOR(k, 0, 10000) {
            if(k+a[i]<=10000) (dp[len+1][k+a[i]] += dp[len][k]) %= mod;
        }
        // cout << dp[1][9] << "\n";
    }
    // cout << sm << "\n";
    vector<ll> fac(n+1);
    fac[0] = 1;
    FOR(i, 1, n) {
        (fac[i] = i*fac[i-1]) %= mod;;
    }
    ll res = 0;
    FOR(len, 1, n-1) {
        (res += dp[len][sm/2]*fac[len]%mod*fac[n-len]%mod) %= mod;
    }
    cout << res << "\n";
    return 0;
}