/**
	author:  shobonvip
	created: 2025.02.21 22:15:00
**/

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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<ll> a(n + 1);
	rep(i,0,n + 1) cin >> a[i];
	
	vector<vector<ll>> cmb(n + 1, vector<ll>(n + 1));
	cmb[0][0] = 1;
	rep(i,1,n+1){
		rep(j,0,i+1){
			if (j == 0 || j == i) {
				cmb[i][j] = 1;
			}else{
				cmb[i][j] = cmb[i-1][j] + cmb[i-1][j-1];
			}
		}
	}
	reverse(all(a));

	vector<ll> b(n + 1);
	rep(i,0,n + 1) {
		rep(j,0,i+1){
			b[j] += cmb[i][j] * a[i] * ((i-j)%2==1?-1:1);
		}
	}
	reverse(all(b));
	rep(i,0,n+1){
		cout << b[i] << ' ';
	}
	cout << endl;
}