#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 105, mod = 998244353;
int a[N], fac[N];
int f[N * N][N];

int main()
{
	int n, i, j, k, ans = 0, sum = 0;
	scanf("%d", &n);
	for(i = 1; i <= n; i++)
		scanf("%d", a + i);
	f[0][0] = 1;
	for(i = 1; i <= n; i++)
	{
		for(j = sum; j >= 0; j--)
			for(k = i; k >= 0; k--)
				f[j + a[i]][k + 1] = (f[j + a[i]][k + 1] + f[j][k]) % mod;
		sum += a[i];
	}
	fac[0] = 1;
	for(i = 1; i <= n; i++)
		fac[i] = (ll)fac[i - 1] * i % mod;
	if(sum & 1)
	{
		printf("0\n");
		return 0;
	}
	for(i = 0; i <= n; i++)
		ans = (ans + (ll)fac[i] * fac[n - i] % mod * f[sum / 2][i]) % mod;
	printf("%d\n", ans);
	return 0;
}