#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<ctime>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
using namespace std;
typedef long long LL;
const int Z=1e4;
const int MOD=998244353;
int n;
int a[101];
LL dp[101][2*Z+1];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    dp[0][Z]=1;
    for(int i=1;i<=n;i++){
        for(int j=-Z;j<=Z;j++){
            if(j-a[i]>=-Z) dp[i][Z+j]+=dp[i-1][Z+j-a[i]];
            if(j+a[i]<=Z) dp[i][Z+j]+=dp[i-1][Z+j+a[i]];
            dp[i][Z+j]%=MOD;
        }
    }
    LL ans=0;
    for(int j=-Z;j<=Z;j++){
        ans+=abs(j)*dp[n][Z+j];
        ans%=MOD;
    }
    cout<<ans<<endl;
    return 0;
}