mod = 998244353
N = int(input())
A = [int(_) for _ in input().split()]
inv = [1] * max(N + 1, 4)

for i in range(2, max(N + 1, 4)):
    inv[i] = mod - mod // i * inv[mod % i] % mod

ans = [0, 0, 0]
coef = [[4, mod - 2, 0], [0, 0, inv[3]]]
if N >= 1:
    ans[2] = (ans[2] + coef[1][2] * A[0]) % mod
if N >= 2:
    ans[0] = (ans[0] + coef[0][0] * A[1]) % mod
    ans[1] = (ans[1] + coef[0][1] * A[1]) % mod
for j, a in enumerate(A[2:], start=3):
    arr = coef[j & 1]
    mul = 4 * (j - 2) * inv[j - 1] % mod
    for i in range(3):
        arr[i] = arr[i] * mul % mod
    arr[1] = (arr[1] - 2 * inv[j - 1]) % mod
    for i in range(3):
        ans[i] = (ans[i] + arr[i] * a) % mod
print(ans[0], ans[1], ans[2])