#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

ll C[35][35];
void solve() {
  C[0][0] = 1;
  rep(i, 30) rep(j, i + 1) {
    C[i + 1][j] += C[i][j];
    C[i + 1][j + 1] += C[i][j];
  }
  ll N;
  cin >> N;
  vector<ll> F(N + 1);
  rep(i, N + 1) cin >> F[i];
  vector<ll> H(N + 1, 0);
  rep(i, N + 1) {
    rep(j, N - i + 1) {
      if (j % 2) {
        H[i + j] -= F[i] * C[N - i][j];
      } else {
        H[i + j] += F[i] * C[N - i][j];
      }
    }
  }
  rep(i, N + 1) cout << (i ? " " : "") << H[i];
  cout << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}