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

mod = 998244353
n = 505050
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod

    
ans = []
for k in range(N - 1):
    ans.append((N - k) * comb(N - 1 + k, k) * pow(N, mod - 2, mod) % mod)
ans.append(ans[-1])
ans.reverse()
v = 0
for i in range(N):
    v += ans[i] * A[i]
    v %= mod 
print(v)