def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n-r] % p

p=998244353
N = 60  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用S
 
for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)

N=int(input())
F=list(map(int,input().split()))
H=[0]*(N+1)
for i in range(N+1):
    for j in range(i,N+1):
        if (j-i)%2==0:
            H[j]+=F[i]*cmb(N-i,j-i,p)
        else:
            H[j]-=F[i]*cmb(N-i,j-i,p)
        #print(i,j,H,f"cmb({N-i},{j-i},{p})",cmb(N-i,j-i,p))
print(*H)