MOD = 998244353
MOD2 = 999630629

n = int(input())
A = list(map(int, input().split()))
times = pow(2, n - 1, MOD)
ans = sum(A) * times % MOD

x = sum(A) - MOD2

if x < 0:
    print(ans)
    exit()

dp = {0:1}
A.sort(reverse = True)
for a in A:
    ndp = {}
    for k, v in dp.items():
        if a + k <= x:
            ndp[a + k] = ndp.get(a + k, 0) + v
    dp = ndp

tot = sum(dp.values()) - 1
ans -= tot * MOD2
print(ans % MOD)