MOD = 998244353
MAX = 100
n = int(input())
a = list(map(int, input().split()))
s = sum(a)
dp = [[0] * (MAX * n + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
    for j in range(MAX * n + 1):
        if j >= a[i]:
            dp[i + 1][j] += dp[i][j - a[i]]
        dp[i + 1][j] += dp[i][j]
        dp[i + 1][j] %= MOD
ans = 0
for i in range(MAX * n + 1):
    if 2 * i - s >= 0:
        ans += (2 * i - s) * dp[-1][i]
    else:
        ans -= (2 * i - s) * dp[-1][i]
print(ans % MOD)