#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    vector dp(n+1, vector<mint>(20010, 0));    
    ll offset = 10000;
    dp[0][offset] = 1;
    rep(i, 0, n) {
        rep(j, 0, 20010) {
            if(j-a[i] >= 0) dp[i+1][j-a[i]] += dp[i][j];
            if(j+a[i] < 20010) dp[i+1][j+a[i]] += dp[i][j];
        }
    }
    mint ans = 0;
    rep(i, 0, 20010) ans += abs(i - offset) * dp[n][i];
    cout << ans.val() << endl;
}

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