#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

typedef long long ll;
typedef modint998244353 mint;
const int MOD = 1000000007;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

    vector<vector<mint>> dp(n + 1, vector<mint>(20001, 0));
    dp[0][10000] = 1;
    rep(i, n){
        rep(j, 20001){
            if(dp[i][j] != 0){
                //B_i = 1の時
                dp[i + 1][j + a[i]] += dp[i][j];
                //B_i = -1の時
                dp[i + 1][j - a[i]] += dp[i][j];
            }
        }
    }

    mint ans = 0;
    rep(i, 20001) ans += dp[n][i] * abs(i - 10000);

    cout << ans.val() << endl;

    return 0;
}