#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int N;cin>>N;
	vector<vector<ll>>binom(30,vector<ll>(30));
	binom[0][0]=1;
	rep(i,0,29)rep(j,0,i+1){
		binom[i+1][j]+=binom[i][j];
		binom[i+1][j+1]+=binom[i][j];
	}
	vector<ll>A(N+1);
	rep(i,0,N+1)cin>>A[i];
	reverse(all(A));
	vector<ll>B(N+1);
	rep(i,0,N+1)rep(j,0,i+1){
		B[j]+=A[i]*binom[i][j]*((i-j)%2?-1:1);
	}
	reverse(all(B));
	rep(i,0,N+1)cout<<B[i]<<(i==N?"\n":" ");
}