n=int(input())
a=list(map(int,input().split()))
mod=998244353
dp=[[0]*20001 for i in range(n+1)]
dp[0][10000]=1

for i in range(n):
    for j in range(20001):
        if dp[i][j] == 0:
            continue
        dp[i+1][j+a[i]] += dp[i][j]
        dp[i+1][j-a[i]] += dp[i][j]
        dp[i+1][j+a[i]] %=mod
        dp[i+1][j-a[i]] %=mod
        
ans=0       
for i in range(len(dp[-1])):
    ans+= abs(i - 10000)*dp[-1][i]
    
print(ans%mod)