/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *                               神兽保佑            永无BUG
 */

/*
 * @Description: I want to be the weakest vegetable in the world!
 * @Author: I.Z.
*/
#include<bits/stdc++.h>
using namespace std;
#define MOD         998244353
#define speMOD      2933256077ll
#define int         long long
#define pii         pair<int,int>
#define all(v)      v.begin(),v.end()
#define pb          push_back
#define REP(i,b,e)  for(int i=(b);i<(int)(e);++i)
#define over(x)     {cout<<(x)<<endl;return;}
#define lowbit(x)   ((x)&(-(x)))
#define cntbit(x)   __builtin_popcount(x)
#define deal(v)     sort(all(v));v.erase(unique(v.begin(),v.end()),v.end())
#define lbound(v,x) lower_bound(all(v),x)-v.begin()
mt19937 sd(random_device{}());
int qpow(int a,int b,int m=MOD,int res=1){
	a%=m;
	while(b>0)res=(b&1)?(res*a%m):(res),a=a*a%m,b>>=1;
	return res;
}
int exgcd(int x,int y,int &a,int &b){
	if(y==0){
		a=1;b=0;
		return x;
	}
	int d=exgcd(y,x%y,a,b);
	int z=b;
	b=a-b*(x/y);
	a=z;
	return d;
}
int _x_,_y_;
inline int inverse(int x,int y=MOD){
	exgcd(x,y,_x_,_y_);
	return (_x_+y)%y;
}
int fac[2000005],inv[2000005];
void init(int n){
	fac[0]=inv[0]=1;
	REP(i,1,n+1)fac[i]=fac[i-1]*i%MOD;
	inv[n]=qpow(fac[n],MOD-2);
	for(int i=n-1;i>=1;--i)inv[i]=inv[i+1]*(i+1)%MOD;
}
int binom(int x,int y){
	return x<y||y<0? 0:fac[x]*inv[y]%MOD*inv[x-y]%MOD;
}
int n;
int a[200005];
int dp[200005],f[200005],g[200005],s[200005],res[200005];
void solve(int l,int r){
	if(l==r)return;
	int m=(l+r)>>1;
	solve(l,m);
	int lmx=a[m],rt=m;
	REP(i,m+1,r+1)f[i]=0;
	for(int i=m;i>=l;--i){
		lmx=max(lmx,a[i]);
		while(rt+1<r&&a[rt+1]<=lmx)++rt;
		if(i+lmx<=rt+1)f[max(m+1,i+lmx)]+=dp[i],f[rt+2]-=dp[i];
	}
	REP(i,m+2,r+1)f[i]+=f[i-1];
	REP(i,m+1,r+1)(dp[i]+=f[i])%=MOD;
	int rmx=a[m+1],lt=m+1;
	REP(i,l,m+2)f[i]=0;
	REP(i,l,m+1)f[i+1]=f[i]+dp[i];
	REP(i,m+2,r+1){
		rmx=max(rmx,a[i-1]);
		while(lt>l&&a[lt-1]<rmx)--lt;
		if(i-rmx>=lt)(dp[i]+=f[min(i-rmx,m)+1]-f[lt])%=MOD;
	}
	solve(m+1,r);
}
int calc(){
	dp[0]=1;
	REP(i,0,n)dp[i+1]=0;
	solve(0,n);
	return dp[n];
}
struct comparism{
	int a,b;
	bool operator >(comparism c){return a==c.a? b<c.b:a>c.a;}
	bool operator <(comparism c){return a==c.a? b>c.b:a<c.a;}
};
comparism max(comparism a,comparism b){return a>b?a:b;}
void solve2(int l,int r,int op=1){
	if(l==r)return;
	int m=(l+r-(op==-1))>>1;
	solve2(l,m,op);solve2(m+1,r,op);
	REP(i,m+1,r+2)s[i]=0;
	REP(i,m+1,r+1)s[i+1]=s[i]+g[i+1];
	if(m!=l){
		comparism mx1={a[m],m*op},mx2={a[m-1],(m-1)*op};
		if(mx1<mx2)swap(mx1,mx2);
		int rt=m;
		for(int i=m-1;i>=l;--i){
			if(i!=m-1){
				comparism c={a[i],i*op};
				if(c>mx1)mx2=mx1,mx1=c;
				else if(c>mx2)mx2=c;
			}
			while(rt<r&&comparism{a[rt+1],(rt+1)*op}<mx2)++rt;
			int l=max(m+1,i+mx2.a-1),r=min(rt,i+mx1.a-2);
			if(l<=r)(dp[mx1.b*op]+=(s[r+1]-s[l])%MOD*f[i])%=MOD;
		}
	}
	{
		comparism mx={a[m],m*op},rmx={a[m+1],(m+1)*op};int rt=m+1;
		for(int i=m;i>=l;--i){
			mx=max(mx,{a[i],i*op});
			while(rt<r&&rmx<mx)++rt,rmx=max(rmx,{a[rt],rt*op});
			if(rmx<mx)break;
			while(rt<r&&comparism{a[rt+1],(rt+1)*op}<mx)++rt;
			int l=max(rmx.b*op,i+mx.a-1),r=min(rt,i+rmx.a-2);
			if(l<=r)(dp[rmx.b*op]+=(s[r+1]-s[l])%MOD*f[i])%=MOD;
		}
	}
}
void Main() {
	cin>>n;
	REP(i,0,n)cin>>a[i];
	reverse(a,a+n);
	calc();
	REP(i,0,n+1)g[n-i]=dp[i];
	reverse(a,a+n);
	calc();
	REP(i,0,n+1)f[i]=dp[i];
	REP(i,0,n)dp[i]=(a[i]>1)*f[i]*g[i+1]%MOD;
	solve2(0,n-1);
	REP(i,0,n)res[i]=dp[i],dp[i]=0;
	reverse(a,a+n);reverse(f,f+n+1);reverse(g,g+n+1);swap(f,g);
	solve2(0,n-1,-1);
	REP(i,0,n)cout<<(dp[n-i-1]+res[i]+f[n])%MOD<<' ';
	cout<<endl;
}
void TC() {
    int tc=1;
	while(tc--){
		Main();
		cout.flush();
	}
}
signed main() {
	return cin.tie(0),cout.tie(0),ios::sync_with_stdio(0),TC(),0;
}
/*
1. CLEAR the arrays (ESPECIALLY multitests)
2. DELETE useless output
 */