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

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

int main() {
	int N;
	cin >> N;
	vector<ll> f(N + 1), h(N + 1);
	rep(i, N + 1) cin >> f[i];
	vector<vector<ll>> dp( 30, vector<ll>( 30 ) );
	function<ll(ll, ll)> nCr = [&](ll n, ll r)
	{
		if(n < r || r < 0) return 0LL;
		if(n==r) return dp[n][r] = 1;
		if(r==0) return dp[n][r] = 1;
		if(r==1) return dp[n][r] = n;
		if(dp[n][r]) return dp[n][r];
		return dp[n][r] = nCr(n-1,r) + nCr(n-1,r-1);
	};
	rep(m, N + 1) {
		rep(n, m + 1) {
			ll a = nCr(N - n, N - m) * f[n];
			if((m - n) % 2) a = -a;
			h[m] += a;
		}
	}
	rep(i, N + 1) cout << h[i] << " ";
	cout << endl;
}