MOD1 = 999630629
MOD2 = 998244353

N = int(input())
A = list(map(int, input().split()))
sum_A = sum(A)

if sum_A < MOD1:
    pow2 = pow(2, N-1, MOD2)
    ans = (sum_A % MOD2) * pow2 % MOD2
else:
    # This part is not feasible to compute for large N and sum_A >= MOD1
    # The code here is a placeholder and would not work for such cases
    pow2 = pow(2, N-1, MOD2)
    total_subsets = (pow(2, N, MOD2) - 1) % MOD2
    # Assuming count_ge is 0 for demonstration (incorrect in general)
    count_ge = 0
    ans = (sum_A * pow2 - MOD1 * count_ge) % MOD2

print(ans)