#include <iostream>
#include <vector>
using namespace std;

typedef long long ll;

// 预计算组合数 C(n, k)
vector<vector<ll>> precompute_combinations(int max_n) {
    vector<vector<ll>> C(max_n + 1, vector<ll>(max_n + 1, 0));
    for (int n = 0; n <= max_n; ++n) {
        C[n][0] = 1;
        for (int k = 1; k <= n; ++k) {
            C[n][k] = C[n-1][k-1] + C[n-1][k];
        }
    }
    return C;
}

int main() {
    int N;
    cin >> N;
    vector<ll> F(N + 1);
    for (int i = 0; i <= N; ++i) {
        cin >> F[i];
    }

    auto C = precompute_combinations(25); // N 最大为25

    vector<ll> H(N + 1, 0);

    for (int j = 0; j <= N; ++j) {
        for (int i = 0; i <= N; ++i) {
            int exponent = N - i; // 原项的次数 (X-1)^exponent
            if (j > exponent) continue;

            ll comb = C[exponent][j];
            ll sign = (exponent - j) % 2 == 0 ? 1 : -1;
            H[j] += F[i] * comb * sign;
        }
    }

    // 调整输出顺序为 H_0 X^N + H_1 X^{N-1} + ... + H_N
    for (int i = 0; i <= N; ++i) {
        cout << H[i];
        if (i != N) cout << " ";
    }
    cout << endl;

    return 0;
}