#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll,ll> P;
#define _for(x,y,z) for (int x(y),_(z); x<=_; ++x)
#define _rep(x,y,z) for (int x(y),_(z); x>=_; --x)
inline ll read(){ ll x; cin>>x; return x; }
inline void _init(){
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
}


const int N = 105;
const ll mod = 998244353;

ll n, fac[N], ans, a[N], dp[N][(N * N) << 1][N];

inline ll f(ll x) {
	return x + 10200;
}

void init() {}
void procedure() {
	cin >> n;
	fac[0] = 1;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		fac[i] = fac[i - 1] * i % mod;
	}
	dp[0][f(0)][0] = 1;
	for (int i = 1; i <= n; ++i) {
		memset(dp[i & 1], 0, sizeof(dp[i & 1]));
		for (int j = -100 * n; j <= 100 * n; ++j) {
			for (int k = 0; k <= n; ++k) {
				dp[i & 1][f(j)][k] = dp[(i & 1) ^ 1][f(j - a[i])][k];
				if (k) {
					dp[i & 1][f(j)][k] = (dp[i & 1][f(j)][k] + dp[(i & 1) ^ 1][f(j + a[i])][k - 1]) % mod;
				}
			}
		}
	}
	for (int i = 0; i <= n; ++i) {
		ans = (ans + dp[n & 1][f(0)][i] * fac[i] % mod * fac[n - i]) % mod;
	}
	cout << ans << "\n";
}

int main() {
	_init(), init();
	int T=1;
	while(T--) procedure();
	return 0;
}