#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, mx = 1e4;
int n, s, ans, a[105], fac[105], dp[10005], f[105][10005];
void add(int &x, int v) {
	(x += v) >= mod ? (x -= mod) : 0;
	return;
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n, fac[0] = 1;
	for(int i = 1; i <= n; i++)
		cin >> a[i], s += a[i], fac[i] = 1ll * fac[i - 1] * i % mod;
	f[0][0] = 1;
	for(int i = 1; i <= n; i++)
		for(int j = i - 1; ~j; j--)
			for(int k = mx; k >= a[i]; k--)
				add(f[j + 1][k], f[j][k - a[i]]);
	for(int i = 0; i < n; i++)
		add(ans, 1ll * f[i][s >> 1] * fac[i] % mod * fac[n - i] % mod);
	cout << ans;
	return 0;
}