#include <bits/stdc++.h>
#define int long long
#define fir first
#define sec second
#define el '\n'
#define FINISH cerr << "FINISH" << endl;
#define debug(x) cerr << #x << " == " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;
ll dp[110][55][5050];
void up(ll &x)
{
	x = (x % mod + mod) % mod;
}
void solve()
{
	int n;
	cin >> n;
	vector<ll> a(n + 1, 0), sum(n + 1, 0), fac(n + 1, 0);
	fac[0] = 1;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		sum[i] = sum[i - 1] + a[i];
		fac[i] = fac[i - 1] * i;
		up(fac[i]);
	}
	if (sum[n] % 2 != 0) {
		cout << "0" << el;
		return;
	}
	dp[0][0][0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= min(i, n / 2); j++) {
			for (int k = 0; k <= min(sum[i], 5000ll); k++) {
				dp[i][j][k] += dp[i - 1][j][k];
				dp[i][j + 1][k + a[i]] += dp[i - 1][j][k];
				up(dp[i][j][k]);
				up(dp[i][j + 1][k + a[i]]);
			}
		}
		// dp[i][1][a[i]] = 1;
	}
	ll ans = 0;
	for (int i = 1; i * 2 < n; i++) {
		ans += dp[n][i][sum[n] / 2] * fac[i] * fac[n - i] * 2;
		up(ans);
	}
	if (n % 2 == 0) {
		ans += dp[n][n / 2][sum[n] / 2] * fac[n / 2] * fac[n / 2];
		up(ans);
	}
	cout << ans << endl;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}