#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 10000+5;
const int ha = 998244353;

inline int qpow(int a,int n=ha-2){
	int res = 1;
	while(n){
		if(n & 1) res = 1ll*res*a%ha;
		a = 1ll*a*a%ha;
		n >>= 1;
	}
	return res;
}

inline void add(int &x,int y){
    x += y-ha;x += x>>31&ha;
}

std::vector<int> R[MAXN];
int fail[MAXN],delta[MAXN],cnt = 0;
int n,a[MAXN];

int main(){
    scanf("%d",&n);FOR(i,1,n) scanf("%d",a+i);
    R[0].clear();
    FOR(i,1,n){
        if(!cnt){
            if(a[i]){
                fail[cnt++] = i;
                delta[i] = a[i];
                R[cnt].resize(i,0);
            }
            continue;
        }
        int sm = 0;delta[i] = a[i];fail[cnt] = i;
        FOR(j,1,SZ(R[cnt])) add(sm,1ll*a[i-j]*R[cnt][j-1]%ha);
        add(delta[i],ha-sm);
        if(!delta[i]) continue;
        int ps = cnt-1;
        FOR(j,0,cnt-2) if(i-fail[j]+SZ(R[j]) < i-fail[ps]+SZ(R[ps])) ps = j;
        int tmp = 1ll*delta[i]*qpow(delta[fail[ps]])%ha;
        R[cnt+1] = R[cnt];
        while(SZ(R[cnt+1]) < i-fail[ps]+SZ(R[ps])) R[cnt+1].pb(0);
        add(R[cnt+1][i-fail[ps]-1],tmp);
        FOR(j,0,SZ(R[ps])-1) add(R[cnt+1][i-fail[ps]+j],ha-1ll*R[ps][j]*tmp%ha);
        ++cnt;
    }
    while(!R[cnt].empty() && !R[cnt].back()) R[cnt].pop_back();
    for(auto x:R[cnt]) printf("%d ",x);puts("");
    return 0;
}