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

#define ll long long
#define ull unsigned long long
#define MAXN 10010
#define int ll
const ll MOD = 998244353;

int fact[MAXN];
void pre()
{
    fact[0] = 1;
    for (int i = 1; i < MAXN; i++)
    {
        fact[i] = fact[i - 1] * i % MOD;
    }
}
ll qpow(ll a, ll b)
{
    ll ans = 0;
    while (b)
    {
        if(b & 1)
            ans = ans * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return ans;
}
ll inv(ll x)
{
    return qpow(x, MOD - 2);
}
ll C(int n, int m)
{
    return fact[n] * inv(fact[m]) % MOD * inv(fact[n - m]) % MOD;
}

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n);
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
    if(sum % 2)
    {
        cout << 0 << '\n';
        return;
    }
    vector dp(n + 1, vector<int>(sum / 2 + 1));
    dp[0][0] = 1;
    for (int tt = 0; tt < n; tt++)
    {
        int x = a[tt];
        for (int i = tt + 1; i >= 1; i--)
        {
            for (int j = sum / 2; j >= x; j--)
            {
                dp[i][j] += dp[i - 1][j - x];
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i <= n; i++)
    {
        (ans += dp[i][sum / 2] * fact[i] % MOD * fact[n - i] % MOD) %= MOD;
    }
    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    pre();
    while (t--)
    {
        solve();
    }
}