#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
int n,a[200005];
int f1[200005],f2[200005];
struct apple{
	int x,y,z;
	apple(int x=0,int y=0,int z=0):x(x),y(y),z(z){}
	bool operator<(const apple &other)const{
		if(x==other.x)return z>other.z;
		return x<other.x;
	}
}e[200005];
long long c[200005];
void add(int x,int s){
	while(x<=n){
		c[x]+=s;
		x+=x&-x;
	}
}
int query(int x){
	long long ans=0;
	while(x){
		ans+=c[x];
		x-=x&-x;
	}
	return ans%mod;
}
int G1[4000005],G2[4000005],G3[4000005],TT=0;
void solve1(int l,int r){
	if(l==r)return;
	int mid=(l+r)>>1;
	solve1(l,mid);
	int tt=0;
	int m1=0;
	for(int i=mid;i>=l;--i){
		int l1=mid-i;
		e[++tt]=apple(l1,max(m1-l1,1),i);
		m1=max(m1,a[i]);
	}
	int mm=0;
	for(int i=mid+1;i<=r;++i){
		mm=max(mm,a[i]);
		int l2=i-mid;
		e[++tt]=apple(max(mm-l2,0),l2,i);
	}
	sort(e+1,e+tt+1);
	for(int i=tt;i>=1;--i){
		if(e[i].z<=mid){
			add(e[i].y,f1[e[i].z]);
		}else{
			f1[e[i].z]=(f1[e[i].z]+(G3[++TT]=query(e[i].y)))%mod;
			G1[TT]=mid+1,G2[TT]=e[i].z;
		}
	}
	for(int i=tt;i>=1;--i){
		if(e[i].z<=mid){
			add(e[i].y,-f1[e[i].z]);
		}
	}
	solve1(mid+1,r);
}
int ans[200005];
void ADD(int l,int r,int z){
	ans[l]=(ans[l]+z)%mod;
	ans[r+1]=(ans[r+1]+mod-z)%mod;
}
void solve2(int l,int r){
	if(l==r)return;
	int mid=(l+r)>>1;
	solve2(mid+1,r);
	int tt=0;
	int m1=0;
	for(int i=mid+1;i<=r;++i){
		int l1=i-mid-1;
		e[++tt]=apple(l1,max(m1-l1,1),-i);
		m1=max(m1,a[i]);
	}
	int mm=0;
	for(int i=mid;i>=l;--i){
		mm=max(mm,a[i]);
		int l2=mid-i+1;
		e[++tt]=apple(max(mm-l2,0),l2,-i);
	}
	sort(e+1,e+tt+1);
	for(int i=tt;i>=1;--i){
		if(-e[i].z>mid){
			add(e[i].y,f2[-e[i].z]);
		}else{
			f2[-e[i].z]=(f2[-e[i].z]+query(e[i].y))%mod;
		}
	}
	for(int i=tt;i>=1;--i){
		if(-e[i].z>mid){
			add(e[i].y,-f2[-e[i].z]);
		}
	}
	solve2(l,mid);
}
struct app2{
	apple a;
	int xs,wz;
	app2(apple a=0,int xs=0,int wz=0):a(a),xs(xs),wz(wz){}
	bool operator<(app2 &other)const{
		return a<other.a;
	}
}ee[400005];
void jiaaa(int &n,apple a,int xs,int wz){
	ee[++n]=app2(a,xs,wz);
}
void sol(int n){
	sort(ee+1,ee+n+1);
	for(int i=n;i>=1;--i){
		if(!ee[i].wz){
			add(ee[i].a.y,ee[i].xs);
		}else{
			ADD(ee[i].wz,ee[i].wz,1ll*ee[i].xs*query(ee[i].a.y)%mod);
		}
	}
	for(int i=n;i>=1;--i){
		if(!ee[i].wz){
			add(ee[i].a.y,-ee[i].xs);
		}
	}
}
void solve(int l,int r){
	if(l==r)return;
	int mid=(l+r)>>1;
	solve(l,mid);solve(mid+1,r);
	int tt=0;
	int m1=0;
	int t1=0,t2=0;
	for(int i=mid;i>=l;--i){
		int l1=mid-i;
		auto ap=apple(l1,max(m1-l1,1),i);
		ee[++t1]=app2(ap,f1[ap.z],0);
		m1=max(m1,a[i]);
	}
	int mm=0;
	int zd=1,cd=1,wz=mid+1;
	for(int i=mid+1;i<=r;++i){
		if(zd<a[i])cd=zd,zd=a[i],wz=i;
		else if(cd<a[i])cd=a[i];
		int l2=i-mid;
		apple a1(zd-l2,l2,i),a2(cd-l2,l2,i);
		jiaaa(t1,a1,mod-f2[i+1],wz);
		jiaaa(t1,a2,f2[i+1],wz);
	}
	sol(t1);
	tt=0;m1=0;mm=0;
	for(int i=mid+1;i<=r;++i){
		mm=max(mm,a[i]);
		int l2=i-mid;
		e[++tt]=apple(l2,max(mm-l2,0)+1,-i);
		ee[++t2]=app2(e[tt],f2[-e[tt].z+1],0);
	}
	zd=1,cd=1,wz=mid;
	for(int i=mid;i>=l;--i){
		if(i<mid){
			int l1=mid-i;
			apple a1(zd-l1,l1+1,i),a2(cd-l1,l1+1,i);
			jiaaa(t2,a1,mod-f1[i],wz);
			jiaaa(t2,a2,f1[i],wz);
		}
		if(zd<a[i])cd=zd,zd=a[i],wz=i;
		else if(cd<a[i])cd=a[i];
	}
	sol(t2);
	for(int i=mid;i>=l;--i){
		int l1=mid-i;
		e[++tt]=apple(max(m1-l1,1),l1+1,-i);
		m1=max(m1,a[i]);
	}
	sort(e+1,e+tt+1);
	for(int i=tt;i>=1;--i){
		if(-e[i].z>mid){
			add(e[i].y,f2[-e[i].z+1]);
		}else{
			ADD(-e[i].z+1,mid,1ll*query(e[i].y)*f1[-e[i].z]%mod);
		}
	}
	for(int i=tt;i>=1;--i){
		if(-e[i].z>mid){
			add(e[i].y,-f2[-e[i].z+1]);
		}
	}
}
namespace file_read{
    namespace input_file_io{
        char ib[1<<25],*ip1=ib,*ip2=ib;
        inline char gc(){
#ifndef ONLINE_JUDGE
			return getchar();
#else
            return (ip1==ip2&&(ip2=(ip1=ib)+fread(ib,1,1<<24,stdin)),ip1==ip2?EOF:*ip1++);
#endif
        }
        inline int read(){
            int x=0;
            char c=gc();
            while(c<'0'||c>'9')c=gc();
            while(c>='0'&&c<='9'){
                x=(x<<3)+(x<<1)+(c^'0');
                c=gc();
            }
            return x;
        }
    };
    namespace output_file_io{
        char ob[1<<25],*op=ob;
        inline void pc(char c){
            *op++=c;
        }
        void write(int x){
            if(x<0){
                pc('-');
                x=-x;
            }
            if(x==0)pc('0');
            static int number_stack[40];
            int total_count=0;
            while(x)number_stack[++total_count]=x%10,x/=10;
            while(total_count){
                pc(number_stack[total_count]+'0');
                --total_count;
            }
        }
        inline void final_write(){
            fwrite(ob,op-ob,1,stdout);
    	}
    };
	using namespace input_file_io;
	using namespace output_file_io;
};
using namespace file_read;
int main(){
	n=read();
	for(int i=1;i<=n;++i)a[i]=read();
	f1[0]=1;solve1(0,n);
	f2[n+1]=1;solve2(1,n+1);
	for(int i=1;i<=TT;++i)ADD(G1[i],G2[i],1ll*G3[i]*f2[G2[i]+1]%mod);
	solve(0,n);
	for(int i=1;i<=n;++i)ans[i]=(ans[i]+ans[i-1])%mod;
	for(int i=1;i<=n;++i)write(ans[i]),pc(i==n?'\n':' ');
	final_write();
	return 0;
}