#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll dp[110][20010];
int main()
{
  int n; scanf("%d", &n);
  
  vector<int> a(n);
  for (int i = 0; i < n; i ++) scanf("%d", &a[i]);
  dp[0][10001] = 1LL;
  for (int i = 0; i < n; i ++)
  {
    for (int j = 1; j <= 20001; j ++)
    {
      (dp[i + 1][min(20001, j + a[i])] += dp[i][j]) %= MOD;
      (dp[i + 1][max(0, j - a[i])] += dp[i][j]) %= MOD; 
    }
  }
  ll ans = 0;
  for (int i = 1; i <= 20001; i ++)
  {
    (ans += abs(i - 10001) * dp[n][i]) %= MOD;
  }
  printf("%lld\n", ans);
  return 0;
}