#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<vector<long long>>com(30, vector<long long>(30));
	com[0][0] = 1;
	rep(i, 30)rep(j, 30) {
		if (i != 0 && j != 0)com[i][j] += com[i - 1][j - 1];
		if (i != 0)com[i][j] += com[i - 1][j];
	}
	int n; cin >> n;
	vector<long long>f(n + 1), g(n + 1);
	rep(i, n + 1)cin >> f[i];
	rep(i, n + 1) {
		rep2(j, i, n + 1) {
			g[j] += f[i] * com[n - i][j - i] * (i % 2 == j % 2 ? 1 : -1);
		}
	}
	rep(i, n + 1)cout << g[i] << " ";
	cout << endl;
	return 0;
}