#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];
    vector<vector<ll>> dp(N + 1, vector<ll>(10001, 0));
    ll MOD = 998244353;
    dp[0][0] = 1;
    rep(i, 0, N) {
        rep(j, 0, 10001) {
            if (j + A[i] < 10001) {
                dp[i + 1][j + A[i]] += dp[i][j];
                dp[i + 1][j + A[i]] %= MOD;
            }
            dp[i + 1][abs(j - A[i])] += dp[i][j];
            dp[i + 1][abs(j - A[i])] %= MOD;
        }
    }
    ll ans = 0;
    rep(i, 0, 10001) {
        ans = (ans + i * dp[N][i] % MOD) % MOD;
    }
    cout << ans << endl;
}