n = int(input())
AA = list(map(int, input().split()))

mod = 14142500797393602217
N = 10 ** 2 + 2
F = [1] * N
E = [1] * N
for i in range(2, N):
    F[i] = F[i-1]*i%mod
E[-1] = pow(F[-1], -1, mod)
for i in range(N-1, 0, -1):
    E[i-1] = E[i]*i%mod

n += 1
def comb(a, b): #組合せ
    if b < 0:
        return 0
    if a < b:
        return 0
    return F[a] * E[b] * E[a-b] % mod

Ans = [0] * n
for i in range(n):
    a = AA[n-1-i]
    for j in range(i, -1, -1):
        Ans[j] += a*comb(i, j)*(-1)**(i-j)

print(*Ans[::-1])