#include<bits/stdc++.h>
using namespace std;
typedef vector<int> poly;
const int N=6e5+5;
const int P=998244353,_G=3,invG=(P+1)/3;
int qpow(int a,int b=P-2){
    int c=1;
    for(;b;b>>=1,a=1ll*a*a%P)
        if(b&1)c=1ll*c*a%P;
    return c;
}
int rev[N<<2];
void NTT(poly&f,int op){
    int n=f.size();
    for(int i=0;i<n;i++)if(i<rev[i])swap(f[i],f[rev[i]]);
    for(int p=2;p<=n;p<<=1){
        int len=p>>1,tG=qpow(op==1?_G:invG,(P-1)/p);
        for(int k=0;k<n;k+=p){
            int buf=1;
            for(int l=k;l<k+len;l++){
                int tmp=1ll*buf*f[len+l]%P;
                f[len+l]=(f[l]-tmp+P)%P;f[l]=(f[l]+tmp)%P;
                buf=1ll*buf*tG%P;
            }
        }
    }
    if(op==-1){
        int invn=qpow(n);
        for(int i=0;i<n;i++)f[i]=1ll*f[i]*invn%P;
    }
}
poly times(poly f,poly g){
    int n=f.size(),m=g.size();
    for(m+=n,n=1;n<=m;n<<=1);f.resize(n);g.resize(n);
    for(int i=0;i<n;i++)rev[i]=(rev[i>>1]>>1)|((i&1)?(n>>1):0);
    NTT(f,1);NTT(g,1);for(int i=0;i<n;i++)f[i]=1ll*f[i]*g[i]%P;NTT(f,-1);
    return f;
}
int n,a[N],fac[N],ifac[N],inv[N];poly f;
void init(int n){
    inv[1]=fac[0]=ifac[0]=1;
    for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%P;
    for(int i=2;i<=n;i++)inv[i]=1ll*(P-P/i)*inv[P%i]%P;
    for(int i=1;i<=n;i++)ifac[i]=1ll*ifac[i-1]*inv[i]%P;
}
poly solve(int l,int r,poly f,int d){
    if(l==r){int sum=0;for(int x:f)sum=(sum+x)%P;return poly{sum};}
    poly g{},tf{},tg{},F{},G{},fx{},h{};
    int mid=(l+r)>>1;fx.resize(a[r]-a[mid]+1);
    for(int i=0;i<=a[r]-a[mid];i++)fx[i]=f[i+a[mid]-d];
    g=solve(mid+1,r,fx,a[mid]);tf.clear();tg.clear();
    int n=r-mid,m=a[mid]-d;tf.resize(m+1);tg.resize(n+1);
    g.resize(n+1);for(int i=n-1;i>=0;i--)g[i+1]=g[i];g[0]=0;
    if(m==0){tg=g;goto label;}
    F.resize(m+1);G.resize(m+n);
    for(int i=1;i<m;i++)F[i]=1ll*f[i]*ifac[i-1]%P;F[0]=F[m]=0;
    for(int i=0;i<=m+n-1;i++)G[i]=fac[m+n-1-i];F=times(F,G);
    for(int i=1;i<=n;i++)tg[i]=(tg[i]+1ll*F[i+m]*ifac[n-i]%P)%P;
    F.resize(n+1);G.resize(n+1);
    for(int i=0;i<=n;i++)G[i]=1ll*fac[n+m-1-i]*ifac[n-i]%P;
    for(int i=1;i<=n;i++)F[i]=g[i];F[0]=0;F=times(F,G);
    for(int i=1;i<=n;i++)tg[i]=(tg[i]+1ll*F[i+n]*ifac[m-1]%P)%P;
    F.resize(n+1);G.resize(m+n);
    for(int i=1;i<=n;i++)F[i]=1ll*g[i]*ifac[i-1]%P;F[0]=0;
    for(int i=0;i<=m+n-1;i++)G[i]=fac[m+n-1-i];F=times(F,G);
    for(int i=1;i<=m;i++)tf[i]=(tf[i]+1ll*F[i+n]*ifac[m-i]%P)%P;
    F.resize(m+1);G.resize(m+1);
    for(int i=0;i<=m;i++)G[i]=1ll*fac[m+n-1-i]*ifac[m-i]%P;
    for(int i=1;i<m;i++)F[i]=f[i];F[0]=F[m]=0;F=times(F,G);
    for(int i=1;i<=m;i++)tf[i]=(tf[i]+1ll*F[i+m]*ifac[n-1]%P)%P;
    tf[m]=(tf[m]+g[0])%P;tg[n]=(tg[n]+f[0])%P;
    label:h=solve(l,mid,tf,d);h.resize(r-l+1);
    for(int i=mid;i<=r;i++)h[i-l]=(h[i-l]+tg[i-mid])%P;
    return h;
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",a+i),--a[i];
    init(555555);f.resize(a[n]+1);
    for(int i=1;i<=a[n];i++)f[i]=1;f=solve(1,n,f,0);f.push_back(1);
    for(int i=n-1;i>=0;i--)f[i]=(f[i+1]+f[i])%P;
    for(int i=0;i<=n;i++)printf("%d ",f[i]);printf("\n");
    return 0;
}