#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint1000000007;

int dh[] = {-1,0,1,0};
int dw[] = {0,1,0,-1};

ll modpow(ll a, ll n, ll m){
    if(n == 0) return 1;
    ll half = modpow(a,n/2,m);
    ll res = half * half % m;
    if(n & 1) res = res * (a%m) % m;
    return res;
}

map<int,ll> dp;

int main(){
    int n; cin >> n;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    dp[0] = 1;
    rep(i,n){
        map<int,ll> ndp;
        repr(j,-10000,10010){
            ndp[j+a[i]] += dp[j];
            ndp[j+a[i]] %= MOD;
            ndp[j-a[i]] += dp[j];
            ndp[j-a[i]] %= MOD;
        }
        swap(dp,ndp);
    }
    ll ans = 0;
    rep(j,10010){
        ans += j*dp[j]%MOD;
        ans %= MOD;
    }
    ans *= 2;
    ans %= MOD;
    cout << ans << endl;
}