#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;


signed main(){
    ll n;cin>>n;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    vector<vector<ll> >dp(n+1,vector<ll>(20010));
    dp[0][10000]=1;
    rep(i,n){
        rep(j,20010){
            if(dp[i][j]==0)continue;
            if(j+a[i]<=20000)dp[i+1][j+a[i]]=(dp[i+1][j+a[i]]+dp[i][j])%mod;
            if(j-a[i]>=0)dp[i+1][j-a[i]]=(dp[i+1][j-a[i]]+dp[i][j])%mod;
        }
    }
    ll ans=0;
    rep(j,dp[n].size()){
        ans=(ans+abs(j-10000)*dp[n][j]%mod)%mod;
    }
    cout<<ans<<endl;
}