#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
const ll mod = 998244353;
ll dp[110][20100];

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    dp[0][10001] = 1LL;
    for (int i = 0; i < n;i++){
        for (int j = 1; j <= 20001;j++){
            dp[i+1][min(20002,j+a[i])] += dp[i][j];
            dp[i+1][min(20002,j+a[i])] %= mod;
            dp[i+1][max(0,j-a[i])] += dp[i][j];
            dp[i+1][max(0,j-a[i])] %= mod;
        }
    }
    ll ans = 0;
    for (int i = 1; i <= 20001;i++){
        ans += abs(i-10001)*dp[n][i];
        ans %= mod;
    }
    cout << ans << endl;
    
    

    return 0;
}