

#pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h> 
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>

using namespace std;
// using namespace atcoder;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<p64,p64> pp64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef pair<ll,p64> tp;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln '\n'
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define zero ll(0)
#define set_bits(x) __builtin_popcountll(x)
// #define mint modint998244353
 
ll mpow(ll a, ll b){
	if(a==0) return 0;
	if(b==0) return 1;
	ll t1 = mpow(a,b/2);
	t1 *= t1;
	t1 %= MOD;
	if(b%2) t1 *= a;
	t1 %= MOD;
	return t1;
}
 
ll mpow(ll a, ll b, ll p){
	if(a==0) return 0;
	if(b==0) return 1;
	ll t1 = mpow(a,b/2,p);
	t1 *= t1;
	t1 %= p;
	if(b%2) t1 *= a;
	t1 %= p;
	return t1;
}
 
ll modinverse(ll a, ll m){
	ll m0 = m; 
    ll y = 0, x = 1; 
    if (m == 1) return 0; 
    while (a > 1){
        ll q = a / m; 
        ll t = m; 
        m = a % m, a = t; 
        t = y; 
        y = x - q * y; 
        x = t; 
    }
    if (x < 0) x += m0; 
    return x; 
}

mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
 
ll range(ll l, ll r){
	return l + mt()%(r-l+1);
}
 
ll rev(ll v){
	return mpow(v,MOD-2);
}

ll nc2(ll n){
	return (n*(n-1))/2;
}

ll dp[101][10001][101];
ll fac[101];
void solve()
{
	fac[0] = 1;
	forsn(i, 1, 101)
	{
		fac[i] = i*fac[i-1];
		fac[i] %= MOD;
	}
	ll n;
	cin>>n;
	v64 w(n);
	forn(i, n) cin>>w[i];
	ll tot = 0;
	dp[0][0][0] = 1;
	forn(i, n)
	{
		tot += w[i];
		forn(j, 10001)
		{
			forn(k, n+1)
			{
				dp[i+1][j][k] = dp[i][j][k];
				if(j-w[i] >= 0 && k-1 >= 0)
				{
					dp[i+1][j][k] += dp[i][j-w[i]][k-1];
					dp[i+1][j][k] %= MOD;
				}
			}
		}
	}
	if(tot%2 == 1)
	{
		cout<<0<<ln;
	}
	else
	{
		ll ans = 0;
		forn(el, n+1)
		{
			//cout<<el<<" "<<dp[n][tot/2][el]<<ln;
			ll temp = dp[n][tot/2][el]*fac[el];
			temp %= MOD;
			temp *= fac[n-el];
			temp %= MOD;
			ans += temp;
			ans %= MOD;
		}
		cout<<ans<<ln;
	}
}

int main()
{
	fast_cin();
	ll t=1;
	// cin >> t;
    forn(i,t) {
    	// cout << "Case #" << i+1 << ": ";
    	solve();
    }
    return 0;
}

#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define LL long long
#define mod 998244353
using namespace std;
int n;
char s[110000];
int f[11010][110];
int a[110];
long long fac[110];
int main()
{
    fac[0]=1;
    for(int i=1;i<=100;i++)fac[i]=fac[i-1]*i%mod;

    cin>>n;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    int sum=0;
    for(int i=1;i<=n;i++)sum+=a[i];
    if (sum%2!=0){ puts("0"); return 0; }
    f[0][0]=1;
    for(int i=1;i<=n;i++)
        for(int j=sum;j>=0;j--)
            for(int k=n;k>=0;k--)
                if (j-a[i]>=0 && k-1>=0)
                (f[j][k]+=f[j-a[i]][k-1])%=mod;
    long long ans=0;
    for(int i=1;i<=n;i++)
    {
        //cout<<i<<" "<<f[sum/2][i]<<endl;
        ans=(ans+f[sum/2][i]*fac[i]%mod*fac[n-i]%mod)%mod;
    }
    cout<<ans<<endl;
    return 0;
}