#include <bits/stdc++.h>
using namespace std;
const int N=1<<22;
int fac[N],inv[N],ifac[N],rev[N],omg[2][N];
int read(){
	int x=0,f=1;
	char ch=getchar();
	while (ch<'0' || ch>'9'){
		if (ch=='-') f=-f;
		ch=getchar();
	}
	while (ch>='0' && ch<='9'){
		x=x*10+ch-48;
		ch=getchar();
	}
	return x*f;
}
const int mod=998244353;
int mul(int x,int y){
	return 1LL*x*y%mod;
}
int sub(int x,int y){
	return x-y<0?x-y+mod:x-y;
}
int add(int x,int y){
	return x+y>=mod?x+y-mod:x+y;
}
int getinv(int x){
	return x<=1?1:mul(mod-mod/x,getinv(mod%x));
}
int fpow(int x,int y){
	int res=1;
	while (y){
		if (y&1) res=mul(res,x);
		x=mul(x,x);y>>=1; 
	}
	return res;
}
void NTT(vector <int> &a,int op){
	int lim=a.size(),len=log2(lim);
	for (int i=0;i<=lim-1;++i){
		int r=rev[i]>>(22-len);
		if (i<r) swap(a[i],a[r]);
	}
	for (int i=1;i<=lim-1;i<<=1){
		for (int j=0;j<=lim-1;j+=i<<1){
			for (int k=0;k<=i-1;++k){
				int tmp=mul(omg[op][N/(i<<1)*k],a[i+j+k]);
				a[i+j+k]=sub(a[j+k],tmp);a[j+k]=add(a[j+k],tmp);
			}
		}
	}
	if (op){
		int invn=getinv(lim);
		for (int i=0;i<=lim-1;++i) a[i]=mul(a[i],invn);
	}
}
vector <int> getinv(vector <int> a){
	int n=a.size();vector <int> b={getinv(a[0])};
	a.resize(1<<(int)ceil(log2(n)));
	for (int lim=2;lim<=2*n-1;lim<<=1){
		vector <int> c(a.begin(),a.begin()+lim);
		c.resize(lim<<1);NTT(c,0);
		b.resize(lim<<1);NTT(b,0);
		for (int i=0;i<=(lim<<1)-1;++i) b[i]=mul(sub(2,mul(c[i],b[i])),b[i]);
		NTT(b,1);b.resize(lim);
	}
	b.resize(n);return b;
} 
vector <int> log(vector <int> a){
	int n=a.size();vector <int> b=getinv(a);
	for (int i=0;i<=n-2;++i) a[i]=mul(a[i+1],i+1);
	a.resize(n-1);
	int lim=1<<(int)ceil(log2(2*n-2));
	a.resize(lim);NTT(a,0);
	b.resize(lim);NTT(b,0);
	for (int i=0;i<=lim-1;++i) a[i]=mul(a[i],b[i]);
	NTT(a,1);a.resize(n);
	for (int i=n-1;i>=1;--i) a[i]=mul(a[i-1],inv[i]);
	a[0]=0;return a;
}
vector <int> exp(vector <int> a){
	int n=a.size();vector <int> b={1};
	a.resize(1<<(int)ceil(log2(n)));
	for (int lim=2;lim<=2*n-1;lim<<=1){
		b.resize(lim);vector <int> c=log(b);
		c[0]=sub(1+a[0],c[0]);
		for (int i=1;i<=lim-1;++i) c[i]=sub(a[i],c[i]);
		c.resize(lim<<1);NTT(c,0);
		b.resize(lim<<1);NTT(b,0);
		for (int i=0;i<=(lim<<1)-1;++i) b[i]=mul(c[i],b[i]);
		NTT(b,1);b.resize(lim);
	}
	b.resize(n);
	return b;
}
vector <int> operator * (vector <int> a,vector <int> b){
	int n=a.size()+b.size()-1,lim=1<<(int)ceil(log2(n));
	a.resize(lim);NTT(a,0);
	b.resize(lim);NTT(b,0);
	for (int i=0;i<=lim-1;++i) a[i]=mul(a[i],b[i]);
	NTT(a,1);a.resize(n);
	return a;
}
vector <int> operator * (vector <int> a,int b){
	int n=a.size();
	for (int i=0;i<n;++i) a[i]=mul(a[i],b);
	return a;
}
vector <int> operator ^ (vector <int> a,int b){
	return exp(log(a)*b);
}
vector <int> sqrt(vector <int> a,int b=2){
	return a^getinv(b);
}
void init(){
	omg[0][0]=1;omg[0][1]=fpow(3,(mod-1)/N);for (int i=2;i<=N-1;++i) omg[0][i]=mul(omg[0][i-1],omg[0][1]);
	omg[1][0]=1;omg[1][1]=getinv(omg[0][1]);for (int i=2;i<=N-1;++i) omg[1][i]=mul(omg[1][i-1],omg[1][1]);
	rev[0]=0;rev[1]=1<<21;for (int i=2;i<=N-1;++i) rev[i]=rev[i>>1]>>1|(i&1)<<21;
	fac[0]=fac[1]=1;for (int i=2;i<=N-1;++i) fac[i]=mul(fac[i-1],i);
	inv[0]=inv[1]=1;for (int i=2;i<=N-1;++i) inv[i]=mul(mod-mod/i,inv[mod%i]);
	ifac[0]=ifac[1]=1;for (int i=2;i<=N-1;++i) ifac[i]=mul(ifac[i-1],inv[i]);	
}
signed main(){
	vector <int> a;init();
	int n=read()-1;a.resize(n+1);
	for (int i=0;i<=n;++i) a[i]=read();
	a=exp(a);
	for (int i=0;i<=n;++i) printf("%d ",a[i]);
	return 0;
}