#include <iostream>
#include <cmath>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

const int C = 10000;
const int mod = 998244353;
int n;
int a[100];
int dp[101][2 * C + 1];

signed main() {
	int i, j;
	
	cin >> n;
	rep(i, n) cin >> a[i];
	
	dp[0][C] = 1;
	rep(i, n) {
		rep(j, 2 * C + 1) {
			if (0 <= j + a[i] && j + a[i] <= 2 * C) (dp[i + 1][j + a[i]] += dp[i][j]) %= mod;
			if (0 <= j - a[i] && j - a[i] <= 2 * C) (dp[i + 1][j - a[i]] += dp[i][j]) %= mod;
		}
	}
	
	int ans = 0;
	rep(j, 2 * C + 1) {
		ans += abs(j - C) * dp[n][j] % mod;
		ans %= mod;
	}
	
	cout << ans << endl;
	return 0;
}