#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

const int M = 10005;
ll dp[105][M * 2];


void solve()
{
    int n;
    scanf("%d", &n);
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
    }
    dp[0][M] = 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < M * 2; j++) {
            if (dp[i][j] == 0) continue;

            int j2 = j + a[i];
            dp[i + 1][j2] = (dp[i + 1][j2] + dp[i][j]) % MOD;
            j2 = j - a[i];
            dp[i + 1][j2] = (dp[i + 1][j2] + dp[i][j]) % MOD;
        }
    }
    ll ans = 0;
    for (int j = 0; j < M * 2; j++) {
        ans = (ans + abs(j-M)*dp[n][j]) % MOD;
    }
    printf("%lld\n", ans);
    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}