def pow(N):
   res = [1]
   for _ in range(N):
      nres = [-x for x in res] + [0]
      for i in range(len(res)):
         nres[i+1] += res[i]
      res = nres
   return res

N = int(input())
F = list(map(int, input().split()))
F.reverse()


def add(A, B):
   res = [0]*max(len(A), len(B))
   for i, a in enumerate(A):
      res[i] += a
   for i, b in enumerate(B):
      res[i] += b
   return res


def mul(A, k):
   return [a*k for a in A]


res = []
for i, f in enumerate(F):
   res = add(res, mul(pow(i), f))
res.reverse()
print(*res)