MOD = 998244353
m = 999630629

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    A = list(map(int, input[1:N+1]))
    sum_A = sum(A)
    
    if sum_A < m:
        ans = sum_A * pow(2, N-1, MOD) % MOD
        print(ans)
        return
    
    # Precompute factorial and inverse factorial modulo MOD up to max_n = N
    max_n = N
    fact = [1] * (max_n + 1)
    for i in range(1, max_n + 1):
        fact[i] = fact[i-1] * i % MOD
    inv_fact = [1] * (max_n + 1)
    inv_fact[max_n] = pow(fact[max_n], MOD-2, MOD)
    for i in range(max_n-1, -1, -1):
        inv_fact[i] = inv_fact[i+1] * (i+1) % MOD
    
    def comb(n, k):
        if k < 0 or k > n:
            return 0
        return fact[n] * inv_fact[k] % MOD * inv_fact[n - k] % MOD
    
    max_t = (sum_A - m) // 10**4  # 36 when sum_A=1e9, m=999630629
    max_t = min(max_t, 36)
    
    C = 0
    for t in range(0, max_t + 1):
        c = comb(N, t)
        C = (C + c) % MOD
    
    term1 = sum_A % MOD
    term1 = term1 * pow(2, N-1, MOD) % MOD
    term2 = m % MOD
    term2 = term2 * C % MOD
    ans = (term1 - term2) % MOD
    ans = (ans + MOD) % MOD  # Ensure non-negative
    print(ans)

if __name__ == '__main__':
    main()