#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;

int main(){
    const ll mod = 998244353;
    int N; cin >> N;
    vector<int> A(N);
    for(int i = 0; i < N; i++)cin >> A[i];
    vector<vector<ll>> dp(N + 1, vector<ll>(30000));
    ll stan = 15000;
    dp[1][stan + A[0]] = 1;
    dp[1][stan - A[0]] = 1;
    for(int i = 1; i < N; i++){
        for(int j = 4990; j <= 25010; j++){
            if(!dp[i][j])continue;
            dp[i + 1][j + A[i]] = (dp[i + 1][j + A[i]] + dp[i][j]) % mod;
            dp[i + 1][j - A[i]] = (dp[i + 1][j - A[i]] + dp[i][j]) % mod;
        }
    }
    ll ans = 0;
    for(ll n = 4990; n <= 25010; n++){
        if(dp[N][n])ans = (ans + (dp[N][n] * abs(n - stan)) % mod) % mod;
    }
    cout << ans << endl;
}