#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <cassert>

using namespace std;
using ll = long long;
using ld = long double;

const int mod = 998244353;

void solve() {
    int n, sum = 0;
    cin >> n;
    vector <int> fact(n + 1, 0);
    fact[0] = 1;
    for (int i = 1; i <= n; i++) {
        fact[i] = 1LL * i * fact[i - 1] % mod;
    }
    vector <int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        sum += v[i];
    }
    if (sum % 2 != 0) {
        cout << 0;
        return;
    }
    int m = sum / 2, ans = 0;
    vector <vector <int>> dp(n + 1, vector <int> (m + 1, 0));
    dp[0][0] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j > 0; j--) {
            ans = (ans + 1LL * dp[j - 1][m - v[i]] * (1LL * fact[j] * fact[n - j] % mod) % mod) % mod;
            for (int k = m; k >= v[i]; k--) {
                dp[j][k] = (dp[j][k] + dp[j - 1][k - v[i]]) % mod;
            }
        }
    }
    cout << ans;
}

signed main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int nrt = 1;
    //cin >> nrt;
    while (nrt--) {
        solve();
    }
    return 0;
}