#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N;
    cin >> N;
    vector<ll> A(N + 1);
    for (int i = 0; i <= N; i++) cin >> A[i];
    reverse(A.begin(), A.end());

    vector<vector<ll>> binom(N + 1, vector<ll>(N + 1, 0));
    binom[0][0] = 1;
    for (int i = 1; i <= N; i++) {
        binom[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
        }
    }

    vector<ll> B(N + 1);
    for (int i = 0; i <= N; i++) {
        ll sign = 1;
        for (int j = i; j >= 0; j--) {
            B[j] += sign * binom[i][j] * A[i];
            sign *= -1;
        }
    }
    reverse(B.begin(), B.end());

    for (int i = 0; i <= N; i++) cout << B[i] << ' ';
    cout << endl;
}