#include <bits/stdc++.h>

using namespace std;

void fast_io() {
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
}

int main() {
	fast_io();
	int n;
	cin >> n;
	vector<long long> f(n + 1);
	for (int i = 0; i <= n; i++) {
		cin >> f[i];
	}
	reverse(f.begin(), f.end());
	vector<vector<long long>> binom(n + 1, vector<long long>(n + 1));
	for (int i = 0; i <= n; i++) {
		binom[i][0] = 1;
		binom[i][i] = 1;

		for (int j = 1; j < i; j++) {
			binom[i][j] = binom[i - 1][j] + binom[i - 1][j - 1];
		}
	}
	vector<long long> h(n + 1);
	for (int i = 0; i <= n; i++) {
		// h += f[i] * (x - 1)^i
		for (int j = 0; j <= i; j++) {
			if ((i - j) % 2 == 1) {
				h[j] -= f[i] * binom[i][j];
			} else {
				h[j] += f[i] * binom[i][j];
			}
		}
	}
	reverse(h.begin(), h.end());
	for (int j = 0; j <= n; j++) {
		cout << h[j] << " ";
	}
	cout << endl;
}