#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

const int MOD = 998244353;

int add(int a, int b){
	a += b;
	if (a >= MOD)
		a -= MOD;
	return a;
}

int mul(int a, int b){
	return a * 1ll * b % MOD;
}

const int N = 103;

int dp[2][N][N * N];

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int> a(n);
	forn(i, n) cin >> a[i];
	
	forn(i, N) forn(j, N * N) dp[0][i][j] = 0;
	dp[0][0][0] = 1;
	forn(ii, n){
		int i = ii & 1;
		int ni = i ^ 1;
		memset(dp[ni], 0, sizeof(dp[ni]));
		forn(j, N) forn(k, N * N) if (dp[i][j][k]){
			dp[ni][j][k] = add(dp[ni][j][k], dp[i][j][k]);
			dp[ni][j + 1][k + a[ii]] = add(dp[ni][j + 1][k + a[ii]], dp[i][j][k]);
		}
	}
	
	vector<int> fact(n + 1);
	fact[0] = 1;
	fore(i, 1, n + 1) fact[i] = mul(fact[i - 1], i);
	
	int sum = accumulate(a.begin(), a.end(), 0);
	if (sum % 2 == 1){
		cout << 0 << '\n';
		return 0;
	}
	
	int ans = 0;
	fore(i, 1, n + 1){
		ans = add(ans, mul(dp[n & 1][i][sum / 2], mul(fact[i], fact[n - i])));
	}
	cout << ans << '\n';
}