#include<bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define pb push_back
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define ff first
#define ss second
template<class T> bool chmax(T& a,T b){return a<b?a=b,1:0;}
template<class T> bool chmin(T& a,T b){return a>b?a=b,1:0;}
const int INFI=numeric_limits<int>::max()/2;
using ll =long long;
using pii =pair<int,int>;
using pll=pair<long long,long long>;
using vi=vector<int>;
using vll=vector<ll>;

ll nck(ll n,ll k){
    ll res=1;
    rep(i,n-k+1,n+1)res*=i;
    rep(i,1,k+1)res/=i;
    return res;
}

#define endl '\n'
int n;
vll f;
void solve(){
    vll h(n+1);
    reverse(all(f));
    rep(i,0,n+1){
        //(x-1)^i
        rep(j,0,i+1){
            if(j&1)h[i-j]-=nck(i,j)*f[i];
            else h[i-j]+=nck(i,j)*f[i];
        }
    }
    reverse(all(h));
    rep(i,0,n+1){
        cout<<h[i]<<' ';
    }
    cout<<endl;
}
int main(){
    cin>>n;f.resize(n+1);
    rep(i,0,n+1){
        cin>>f[i];
    }
    solve();
    return 0;
}
/*



*/