#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

const long long modc = 998244353;

int main(){

    long long N, ans=0;
    cin >> N;
    vector<long long> A(N);
    for (int i=0; i<N; i++) cin >> A[i];
    vector<vector<long long>> dp(N+1, vector<long long>(20001));
    dp[0][10000] = 1;
    for (int i=1; i<=N; i++){
        for (int j=0; j<=20000; j++){
            if (j+A[i-1]<=20000){
                dp[i][j+A[i-1]] += dp[i-1][j];
                dp[i][j+A[i-1]] %= modc;
            }
            if (j-A[i-1]>=0){
                dp[i][j-A[i-1]] += dp[i-1][j];
                dp[i][j-A[i-1]] %= modc;
            }   
        }
    }

    for (long long i=0; i<=20000; i++){
        ans += (abs(i-10000) * dp[N][i]) % modc;
        ans %= modc;
    }

    cout << ans << endl;

    return 0;
}