//minamoto

 #include<iostream>

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 #define swap(x,y) (x^=y,y^=x,x^=y)

 #define mul(x,y) (1ll*x*y%P)

 #define add(x,y) (x+y>=P?x+y-P:x+y)

 #define dec(x,y) (x-y<0?x-y+P:x-y)

 using namespace std;

 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)

 char buf[<<],*p1=buf,*p2=buf;

 inline int read(){

     #define num ch-'0'

     char ch;bool flag=;int res;

     while(!isdigit(ch=getc()))

     (ch=='-')&&(flag=true);

     for(res=num;isdigit(ch=getc());res=res*+num);

     (flag)&&(res=-res);

     #undef num

     return res;

 }

 char sr[<<],z[];int C=-,Z;

 inline void Ot(){fwrite(sr,,C+,stdout),C=-;}

 inline void print(int x){

     if(C><<)Ot();if(x<)sr[++C]=,x=-x;

     while(z[++Z]=x%+,x/=);

     while(sr[++C]=z[Z],--Z);sr[++C]=' ';

 }

 const int N=,P=;

 inline int ksm(int a,int b){

     int res=;

     while(b){

         if(b&) res=mul(res,a);

         a=mul(a,a),b>>=;

     }

     return res;

 }

 int n,r[N],g[N],f[N],A[N],B[N],O[N],limit,l;

 inline void init(int len){

     limit=,l=;

     while(limit<len*) limit<<=,++l;

     for(int i=;i<limit;++i)

     r[i]=(r[i>>]>>)|((i&)<<(l-));

 }

 void NTT(int *A,int type){

     for(int i=;i<limit;++i)

     if(i<r[i]) swap(A[i],A[r[i]]);

     for(int mid=;mid<limit;mid<<=){

         int R=mid<<,Wn=ksm(,(P-)/R);O[]=;

         for(int j=;j<mid;++j) O[j]=mul(O[j-],Wn);

         for(int j=;j<limit;j+=R){

             for(int k=;k<mid;++k){

                 int x=A[j+k],y=mul(O[k],A[j+k+mid]);

                 A[j+k]=add(x,y),A[j+k+mid]=dec(x,y);

             }

         }

     }

     if(type==-){

         reverse(A+,A+limit);

         for(int i=,inv=ksm(limit,P-);i<limit;++i)

         A[i]=mul(A[i],inv);

     }

 }

 void CDQ(int *a,int *b,int l,int r){

     if(l==r) return;

     int mid=(l+r)>>;CDQ(a,b,l,mid);

     init(r-l+);

     for(int i=;i<limit;++i) A[i]=B[i]=;

     for(int i=l;i<=mid;++i) A[i-l]=a[i];

     for(int i=;i<=r-l;++i) B[i]=b[i];

     NTT(A,),NTT(B,);

     for(int i=;i<limit;++i) A[i]=mul(A[i],B[i]);

     NTT(A,-);

     for(int i=mid+;i<=r;++i) a[i]=add(a[i],A[i-l]);

     CDQ(a,b,mid+,r);

 }

 int main(){

 //    freopen("testdata.in","r",stdin);

     n=read();

     for(int i=;i<n;++i) g[i]=read();f[]=;

     CDQ(f,g,,n-);

     for(int i=;i<n;++i) print(f[i]);

     Ot();

     return ;

 }