#include <cstdio>
#include <iostream>
using std::string;
const long long mod = 998244353;
long long f[105][20005];
//int a[105];

int main(){
	int n;
	scanf("%d",&n);
	int off = 10001;
	f[0][off] = 1;
	long long ans = 0;
	for(int i = 1; i <= n; i++){
		int u;
		scanf("%d",&u);
		for(int j = -10000; j <= 10000; j++){
			f[i][j+off] = 0;
			int last = j-u;
			if(last>=-10000) f[i][j+off] += f[i-1][last+off];
			f[i][j+off] %= mod;
			last = j+u;
			if(last<=10000) f[i][j+off] += f[i-1][last+off];
			f[i][j+off] %= mod;
			if(i==n){
				long long val = j;
				if(j<0) val *= -1;
				ans = (ans + val*f[i][j+off]%mod)%mod;
			}
		}
	}
	printf("%lld\n",ans);
	return 0;
}