#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxsize = (1 << 21) + 10;
ll qpow (ll x, ll k, ll mod){return k==0? 1: 1ll*qpow(1ll*x*x%mod,k>>1, mod)*(k&1?x:1)%mod;}
//NTT head - START
template <const int mod, const int proot> struct ntt {
	int n, M, w_pre[maxsize], inv[maxsize];
	ntt() {
		M = 1; while (M*2<maxsize) M <<= 1;
		int w = qpow(proot, (mod-1)/M, mod);
		w_pre[0] = 1;
		for (int i=1; i<=M; i++) w_pre[i] = 1ll*w_pre[i-1]*w%mod;
		inv[1] = 1;
		for (int i=2; i<maxsize; i++) inv[i] = mod-1ll*inv[mod%i]*(mod/i)%mod;
	}
	void FFTinit(int sz) {
		n = 1; while (n<sz) n <<= 1;
		assert(n<=M);
	}
	void FFT(int a[], int coef) {
		typedef unsigned long long ull;
		const ull mod2=1ull*mod*mod;
		static ull na[maxsize];
		for (int i=0, j=0; i<n; i++) {
			na[j] = a[i]<0? a[i]+mod: a[i];
			for (int l=n>>1; (j^=l)<l; l>>=1) continue;
		}
		static int w[maxsize];
		for (int l=1; l<n; l<<=1) {
			int l2=l+l, u=M/l2;
			if (coef==1) {
				for (int j=0, t=0; j<l; j++, t+=u) w[j] = w_pre[t];
			} else {
				for (int j=0, t=M; j<l; j++, t-=u) w[j] = w_pre[t];
			}
			for (int i=0; i<n; i+=l2) {
				for (int j=0; j<l; j++) {
					ull tmp = na[i+j+l]%mod*w[j];
					na[i+j+l] = na[i+j]-tmp+mod2;
					na[i+j] += tmp;
				}
			}
			if(l==(1<<8)||l==(1<<16)) for (int i=0; i<n; i++) na[i] %= mod;
		}
		for (int i=0; i<n; i++) a[i] = 1ll*na[i]%mod*(coef==-1?inv[n]:1)%mod;
	}
	vector<int> multi(const vector<int> &A, const vector<int> &B, int N=-1) {
		if (N==-1) N = max(0, int(A.size()+B.size())-1);
		FFTinit(A.size()+B.size());
		static int a[maxsize], b[maxsize];
		for (int i=0; i<n; i++) a[i] = i<A.size()? A[i]%mod: 0;
		for (int i=0; i<n; i++) b[i] = i<B.size()? B[i]%mod: 0;
		FFT(a,1), FFT(b,1);
		for (int i=0; i<n; i++) a[i] = 1ll*a[i]*b[i]%mod;
		FFT(a,-1);
		vector<int> ret(N);
		for (int i=0; i<N; i++) ret[i] = a[i];
		return ret; 
	}
    vector<int> calcinv(const vector<int> &A, int m) {
        vector<int> ret(m);
        if(m == 1) {
            ret[0] = qpow(A[0], mod - 2, mod);
            return ret;
        }
        auto B = calcinv(A, (m+1) / 2);
        static int a[maxsize], b[maxsize];
        FFTinit(min(int(A.size()), m) + B.size() * 2 - 2);
        for(int i=0; i<n; i++) a[i] = i<A.size() ? A[i] % mod : 0;
        for(int i=0; i<n; i++) b[i] = i<B.size() ? B[i] % mod : 0;
        FFT(a, 1); FFT(b, 1);
        for(int i=0; i<n; i++) a[i] = (mod + 2 - 1ll * a[i] * b[i] % mod) * b[i] % mod;
        FFT(a, -1);
        for(int i=0; i<m; i++) ret[i] = a[i];
        return ret;
    }
};
ntt <998244353, 3> MS;

int n, a[1000111];
int main() {
    scanf("%d", &n);
    for(int i=0; i<n; i++) scanf("%d", a+i);
    for(int i=0; i<n; i++) a[i] = rand() + 1;
    auto B = MS.calcinv(vector<int>(a, a+n), n);
    for(auto v : B) printf("%d ", v);
    return 0;
}