/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 998244353;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

void solve(){
  ll N;
  cin >> N;
  vll A(N);
  rep(i,0,N) cin >> A[i];
  vector<vll> dp(N+1, vll(20010, 0));
  ll M = 10000;
  dp[0][M] = 1;
  rep(i,0,N){
    rep(j,0,2*M+1){
      if(j+A[i] <= 2*M){
        dp[i+1][j+A[i]] += dp[i][j];
        dp[i+1][j+A[i]] %= MOD;
      }
      if(j - A[i] >= 0){
        dp[i+1][j-A[i]] += dp[i][j];
        dp[i+1][j-A[i]] %= MOD;
      }
    }
  }
  ll ans = 0;
  rep(i,0,2*M+1){
    ans += dp[N][i] * abs(i-M);
    ans %= MOD;
  }
  print(ans);



}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}