#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int qmod(int x) { return x >= mod ? x - mod : x; }
template <typename T>
void read(T &x)
{
	T sgn = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
template <typename T>
void write(T x)
{
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
template <typename T>
void print(T x)
{
	if (x < 0) putchar('-'), x = -x;
	write(x);
	putchar('\n');
}
int n, a[105], dp[10005][105], fac[105];
int main()
{
	read(n);
	fac[0] = 1;
	for (int i = 1; i <= n; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
	int sum = 0;
	for (int i = 1; i <= n; i++) read(a[i]), sum += a[i];
	sum /= 2;
	dp[0][0] = 1;
	for (int i = 1; i <= n; i++){
		for (int j = sum; j >= a[i]; j--)
		{
			for (int k = i; k >= 1; k--)
			{
				dp[j][k] = qmod(dp[j][k] + dp[j - a[i]][k - 1]);
			}
			
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++)
	{
		ans = qmod(ans + 1ll * dp[sum][i] * fac[i] % mod * fac[n - i] % mod);
	}
	printf("%d\n", ans);
	return 0;
}