MOD = 998244353
M = 999630629

n = int(input())
a = list(map(int, input().split()))
sum_a = sum(a)

if sum_a < M:
    power = pow(2, n-1, MOD)
    ans = (sum_a % MOD) * power % MOD
    print(ans)
else:
    # This part is not handled in the solution but is required for completeness
    pass