#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define int long long
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N = 5e05+10;
const LL mod = 998244353;
const int inf = 0x3f3f3f3f;
const LL llinf = 5e18;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >mi;//小根堆
priority_queue<LL> ma;//大根堆
#define LL long long
struct comb{
	vector<LL>f , g;//阶乘以及分母式子的逆元
	comb(){}
	comb(int n) : f(n) , g(n){
		init(n);
	}
	LL qpow(LL a , LL b)//快速幂
	{
		LL sum=1;
		while(b){
			if(b&1){
				sum=sum*a%mod;
			}
			a=a*a%mod;
			b>>=1;
		}
		return sum;
	}
	void init(int n){
		f[0] = g[0] = 1;
		for(int i = 1;i < n; i ++){
	    	f[i] = f[i - 1] * i % mod; //计算i的阶乘
		}
		g[n - 1] = qpow(f[n - 1] , mod - 2);
		for(int i = n - 1 ; i >= 1 ; i --){
			g[i - 1] = g[i] * i % mod;
		}
	}
	LL get(int n,int m){ //得到C(n,m)的组合数答案
		if(n < m)
			return 0;
		else
	    	return f[n] * g[m] % mod * g[n-m] % mod;
	}	
}calc(1000);
void solve() 
{
	vector<vector<int>>dp(10005 , vector<int>(105 , 0));
	dp[0][0] = 1;
	int tot = 0;
	int n;
	cin >> n;
	for(int i = 0 ; i < n ; i ++){
		int x;
		cin >> x;
		tot += x;
		for(int k = 100 ; k >= 1 ; k --){
			for(int j = 10000 - x; j >= 0 ; j --){
				dp[j + x][k] += dp[j][k - 1];
			}			
		}
	}
	int ans = 0;
	if(tot & 1){
		cout << 0 << endl;
		return;
	}
	for(int i = 1 ; i <= n ; i ++){
		ans += (dp[tot / 2][i] * calc.f[i] % mod) * calc.f[n - i];
		ans %= mod;
	}
	//DP[I] = (1-P)DP[I] + DP[I - 1] * t * P
	cout << ans << endl;
}            
signed main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
	//cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}