n=int(input())
a=[0]+list(map(int,input().split()))
suma=sum(a)
mod=998244353
dp=[[0]*(2*sum(a)+1000) for i in range(n+1)]
dp[0][0]=1
for i in range(1,n+1):
    for j in range(-suma-10,suma+10):
        dp[i][j]=dp[i-1][j-a[i]]+dp[i-1][j+a[i]]
        dp[i][j]%=mod

ans=0
for j in range(-suma-10,suma+10):
    ans+=abs(j)*dp[n][j]
    ans%=mod

print(ans)