#include #include #define LL long long #define Re register int using namespace std; const int N=262144+3,P=998244353,G=3; int n,A[N],B[N]; inline void in(Re &x){ int f=0;x=0;char c=getchar(); while(c<'0'||c>'9')f|=c=='-',c=getchar(); while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar(); x=f?-x:x; } inline int mi(Re x,Re k){ Re s=1; while(k){ if(k&1)s=(LL)s*x%P; x=(LL)x*x%P,k>>=1; } return s; } inline int inv(Re x){return mi(x,P-2);} int invG,tr[N]; inline void NTT(Re *f,Re n,Re op){ for(Re i=0;i>1,w1=mi(op?invG:G,(P-1)/p);st>1]>>1)|((i&1)?n>>1:0); NTT(f,n,0),NTT(g,n,0); for(Re i=0;i>1,b); for(Re i=0;i<=n;++i)f[i]=a[i],g[i]=b[i]; times(f,n,g,n,1); for(Re i=0;i<=n;++i)b[i]=(2*b[i]%P-f[i]+P)%P; } int main(){ // freopen("123.txt","r",stdin); in(n),--n; for(Re i=0;i<=n;++i)in(A[i]),A[i]%=P; polyinv(A,n,B); for(Re i=0;i<=n;++i)printf("%d ",B[i]); }