#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pint = pair<int,int>;

#include"atcoder/modint"
using mint = atcoder::modint998244353; 
ostream &operator<<(std::ostream &os,const mint &p){return os << p.val();}
istream &operator>>(std::istream &is, mint &a){int64_t x;is >> x;a = mint(x);return (is);}

int main()
{
	int N; cin >> N;
	vector<int> A(N);
	for(auto &i : A) cin >> i;
	vector<vector<mint>> dp(N + 1, vector<mint>(20001));
	
	int GETA = 10000;
	dp[0][GETA] = 1;

	for(int i = 0; i < N; i++) {
		for(int j = 0; j <= GETA * 2; j++) {
			if(j + A[i] <= GETA * 2)dp[i + 1][j + A[i]] += dp[i][j];
			if(j - A[i] > 0)        dp[i + 1][j - A[i]] += dp[i][j];
		}
	}

	mint sum = 0;
	for(int i = 0; i <= GETA + GETA; i++) {
		sum += abs(i - GETA) * dp[N][i];
	}

	cout << sum << endl;

}