MOD = 998244353
N = int(input())
A = list(map(int, input().split()))
offset = sum(A) # 全部出した時の上限
DP = [[0] * (2*offset + 1) for _ in range(N + 1)]
DP[0][offset] = 1

for i in range(N):
    a = A[i]
    for j in range(2*offset + 1):
        if DP[i][j] == 0:
            continue
        DP[i + 1][j - a] += DP[i][j]
        DP[i + 1][j - a] %= MOD
        DP[i + 1][j + a] += DP[i][j]
        DP[i + 1][j + a] %= MOD

ans = 0
for j in range(2*offset + 1): # 実際の値は j-offset する
    ans += abs(j - offset) * DP[-1][j]
    ans %= MOD

print(ans)