#include <bits/stdc++.h>
#define ll long long
#define inf 0x7fffffff
#define ull unsigned long long
#define llinf 0x7fffffffffffffff
#define F(a,b,c,d) for(int b=c;b<=d;b+=a)
#define F2(a,b,c,d) for(int b=c;b>=d;b-=a)
#define PRC(b,a) fixed<<setprecision(a)<<b
#define pb push_back
#define All(x) x.begin(),x.end()
#define Next(a,b) for(int a=head[b];a;a=edge[a].nxt)
#define IOS ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
using namespace std;
inline ll Gcd(ll xx,ll yy){return yy?Gcd(yy,xx%yy):xx;}
inline ll q_Pow(ll xx,ll yy,ll pp){ll oo=1;for(;yy;yy>>=1,xx=xx*xx%pp)yy&1?oo=oo*xx%pp:0;return oo;}
inline void Cout(){cout<<endl;}
template <class T1,class...T2>
inline void Cout(T1 x,T2 ...y){cout<<x<<' ';Cout(y...);}

const int N=105,mod=998244353;

int n,a[N];
ll f[N][N*N];

signed main(){
  IOS

  cin>>n;
  for(int i=1;i<=n;++i) cin>>a[i];

  f[0][0]=1;
  for(int i=1;i<=n;++i)
    for(int j=0;j<=10000;++j){
      f[i][j+a[i]]+=f[i-1][j]%=mod;
      f[i][abs(j-a[i])]+=f[i-1][j]%=mod;
    }

  ll ans=0;
  for(int i=0;i<=10000;++i) ans=(ans+f[n][i]*i)%mod;
  cout<<ans<<'\n';
  
  return 0;
}