#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=1000005,mod=998244353;
int ADD(int x,int y){return x+y>=mod?(x+y-mod):(x+y);}
int SUB(int x,int y){return x-y<0?(x-y+mod):(x-y);}
void add(int &x,int y){x=x+y>=mod?(x+y-mod):(x+y);}
void sub(int &x,int y){x=x-y<0?(x-y+mod):(x-y);}
namespace poly{
	const int g=3,ginv=(mod+1)/3,inv2=(mod+1)/2;
	int rev[N<<2],A[N<<2],B[N<<2];
	ull f[N<<2],w[N<<2];
	int ksm(int x,int y){
		int s=1;
		while (y){
			if (y&1)s=1ll*s*x%mod;
			x=1ll*x*x%mod;
			y>>=1;
		}
		return s;
	}
	void ntt(int n,int *a,int tp){
		for (int i=0;i<n;i++)f[i]=a[rev[i]];
		for (int i=1;i<n;i<<=1){
			int len=(i<<1),g1=ksm(tp==1?g:ginv,(mod-1)/len);
			w[0]=1;
			for (int j=1;j<i;++j)w[j]=w[j-1]*g1%mod;
			for (int j=0;j<n;j+=len){
				for (int k=0;k<i;++k){
					ull x=f[k|j],y=w[k]*f[k|i|j]%mod;
					f[k|j]+=y;
					f[k|i|j]=x+mod-y;
				}
			}
			if (i==(1<<17))for (int j=0;j<n;++j)f[j]%=mod;
		}
		if (tp==-1){
			int nn=ksm(n,mod-2);
			for (int i=0;i<n;i++)a[i]=f[i]%mod*nn%mod; 
		}
		else{
			for (int i=0;i<n;++i)a[i]=f[i]%mod;
		}
	}
	int calc(int a,int b,bool typ){return !typ?(1ll*a*b%mod):(1ll*a*((mod+2-1ll*a*b%mod)%mod)%mod);}
	void mul(int len,int *a,int *b,bool typ){
		len--;
		int n=1,s=0;while (n<=len+2)n<<=1,s++;
		rev[0]=0;for (int i=1;i<n;i++)rev[i]=(rev[i>>1]>>1)|((i&1)<<(s-1));
		for (int i=0;i<n;i++)A[i]=(i<=len?a[i]:0),B[i]=(i<=len?b[i]:0);
		ntt(n,A,1),ntt(n,B,1);
		for (int i=0;i<n;i++)A[i]=calc(A[i],B[i],typ);
		ntt(n,A,-1);
		for (int i=0;i<n;++i)a[i]=(i<=len?A[i]:0);
		for (int i=0;i<n;i++)A[i]=B[i]=0;
	}
	void poly_inv(int n,int *a,int *b){
		if (n==1){b[0]=ksm(a[0],mod-2);return;}
		poly_inv((n+1)>>1,a,b);
		mul(n,b,a,1);
	}
}
int n,a[N<<2],m,b[N<<2];
const int mod2=mod-1;
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	for (int i=0;i<n;++i)cin>>a[i];
	poly::poly_inv(n,a,b);
	for (int i=0;i<n;++i)cout<<b[i]<<" ";
}