#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, j, n) for (int i = j; i < (int)n; i++)
using ll = long long int;

int main() {
  int n;
  cin >> n;
  vector<int> f(n+1);
  rep(i, n+1)
    cin >> f[i];
  vector<ll> g(n+1);
  vector<int> tmp(n+1, 0);
  vector<int> tmp1(n+1, 0);
  g[0] = 0;
  rep(i, n+1) {
    tmp1[0] = 1;
    rep1(j, 1, i+1) {
      tmp1[j] = tmp[j-1] + tmp[j];
    }
    int fugo = 1;
    if (i % 2 == 1) fugo *= -1;
    rep(j, i+1) {
      tmp[j] = tmp1[j];
      g[j] += (ll)fugo * (ll)tmp[j] * (ll)f[n-i];
      fugo *= -1;
    }
  }
  rep(i, n+1)
    cout << g[n-i] << " ";
  cout << endl;
  return 0;
}