#include using namespace std; #include using namespace atcoder; using mint = atcoder::static_modint<998244353>; // // using mint = atcoder::static_modint<1000000007>; using ld = long double; using ll = long long; #define mp(a,b) make_pair(a,b) #define rep(i,s,n) for(int i=s; i<(int)n; i++) const vector dx{1,0,-1,0},dy{0,1,0,-1}; template struct Factorial{ Factorial(int _n):fac(_n+1,1),invfac(_n+1,1){ for(int i=1; i<=_n; i++){ fac[i]=fac[i-1]*i; invfac[i]/=fac[i]; } }; T nCr(int n,int r){ if(0<=r && r<=n)return fac[n]*invfac[r]*invfac[n-r]; else return 0; } T nPr(int n,int r){ if(0<=r && r<=n)return fac[n]*invfac[n-r]; else return 0; } T sum(int a,int b){ // \Sigma_{i\in[0,a],j\in[0,b]}(i+j)Ciを計算 return nCr(a+b+2,a+1)-1; } vector fac,invfac; }; int main(){ int n;cin >> n; vector F(n+1);rep(i,0,n+1)cin >> F[n-i]; Factorial A(30); vector ans(n+1); rep(i,0,n+1){ ll k=1; for(int j=i; j>=0; j--){ ans[j]+=k*A.nCr(i,j).val()*F[i]; k*=-1; } } rep(i,0,n+1)cout << ans[n-i] << " "; }