//Author: Kevin
#include<bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
//#pragma GCC optimize("O2")
using namespace std;
#define ll unsigned long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
namespace Polynomial
{
	using poly=vector<ll>;
	const ll mod=998244353;
	inline ll red(ll x){return (x>=mod)?(x-mod):x;}
	ll ksm(ll a,ll b)
	{
		ll ans=1;
		while(b)
		{
			if(b&1) ans=ans*a%mod;
			b>>=1;
			a=a*a%mod;
		}
		return ans;
	}
	ll minv[10001000];
	ll getinv(ll x)
	{
		if(x<=10000000) return minv[x];
		return getinv(mod%x)*(mod-mod/x)%mod;
	}
	const poly operator +(const poly &a,const poly &b)
	{
		int p=sz(a),q=sz(b);
		int n=max(p,q);
		poly ret(n,0);
		for(int i=0;i<n;i++)
		{
			if(i<p) ret[i]+=a[i];
			if(i<q) ret[i]+=b[i];
			if(ret[i]>=mod) ret[i]-=mod;
		}
		return ret;
	}
	const poly operator -(const poly &a,const poly &b)
	{
		int p=sz(a),q=sz(b);
		int n=max(p,q);
		poly ret(n,0);
		for(int i=0;i<n;i++)
		{
			if(i<p) ret[i]+=a[i];
			if(i<q) ret[i]+=mod-b[i];
			if(ret[i]>=mod) ret[i]-=mod;
		}
		return ret;
	}
	ll gpw[20][1001000],rgpw[20][1001000];
	poly operator *(poly a,poly b)
	{
		if(min(sz(a),sz(b))<=100)
		{
			int add=0;
			while(sz(b)%8)
			{
				b.pb(0);
				add++;
			}
			poly ret(sz(a)+sz(b)-1);
			for(int i=0;i<sz(a);i++)
			{
				for(int j=0;j<sz(b);j+=8)
				{
					ret[i+j]=(ret[i+j]+a[i]*b[j])%mod;
					ret[i+j+1]=(ret[i+j+1]+a[i]*b[j+1])%mod;
					ret[i+j+2]=(ret[i+j+2]+a[i]*b[j+2])%mod;
					ret[i+j+3]=(ret[i+j+3]+a[i]*b[j+3])%mod;
					ret[i+j+4]=(ret[i+j+4]+a[i]*b[j+4])%mod;
					ret[i+j+5]=(ret[i+j+5]+a[i]*b[j+5])%mod;
					ret[i+j+6]=(ret[i+j+6]+a[i]*b[j+6])%mod;
					ret[i+j+7]=(ret[i+j+7]+a[i]*b[j+7])%mod;
				}
			}
			while(add--) ret.pop_back();
			return ret;
		}
		const ll g=3;
		int len=sz(a)+sz(b);
		int m=1;
		while(m<sz(a)+sz(b)) m*=2;
		a.resize(m);
		b.resize(m);
		vector<int> rev(m);
		for(int i=0;i<m;i++)
			rev[i]=(rev[i>>1]>>1)|((i&1)*(m>>1));
		for(int i=0;i<m;i++)
			if(rev[i]<i)
			{
				swap(a[i],a[rev[i]]);
				swap(b[i],b[rev[i]]);
			}
		for(int i=1;i<m;i<<=1)
		{
			for(int j=0;j<m;j+=(i<<1))
			{
				for(int k=0;k<i;k++)
				{
					ll g0=gpw[__lg(i)][k];
					{
						ll x=a[j+k],y=g0*a[i+j+k]%mod;
						a[j+k]=red(x+y);
						a[i+j+k]=red(x+mod-y);
					}
					{
						ll x=b[j+k],y=g0*b[i+j+k]%mod;
						b[j+k]=red(x+y);
						b[i+j+k]=red(x+mod-y);
					}
				}
			}
		}
		for(int i=0;i<m;i++)
			a[i]=a[i]*b[i]%mod;
		for(int i=0;i<m;i++)
			if(rev[i]<i)
				swap(a[i],a[rev[i]]);
		for(int i=1;i<m;i<<=1)
		{
			for(int j=0;j<m;j+=(i<<1))
			{
				for(int k=0;k<i;k++)
				{
					ll x=a[j+k],y=rgpw[__lg(i)][k]*a[i+j+k]%mod;
					a[j+k]=red(x+y);
					a[i+j+k]=red(x+mod-y);
				}
			}
		}
		ll val=getinv(m);
		for(int i=0;i<m;i++)
			a[i]=a[i]*val%mod;
		a.resize(len-1);
		return a;
	}
	void init()
	{
		minv[1]=1;
		for(int i=2;i<=10000000;i++)
			minv[i]=minv[mod%i]*(mod-mod/i)%mod;
		for(int i=0;i<18;i++)
		{
			ll gn=ksm(3,(mod-1)/(1<<i)/2);
			ll rgn=getinv(gn);
			ll tmp1=1,tmp2=1;
			for(int j=0;j<(1<<i);j++)
			{
				gpw[i][j]=tmp1;
				rgpw[i][j]=tmp2;
				tmp1=tmp1*gn%mod;
				tmp2=tmp2*rgn%mod;
			}
		}
	}
	poly deriv(poly p)
	{
		for(int i=0;i<sz(p);i++)
			p[i]=p[i]*i%mod;
		p.erase(p.begin());
		return p;
	}
	poly integ(poly p)
	{
		p.insert(p.begin(),0);
		for(int i=0;i<sz(p);i++)
			p[i]=p[i]*ksm(i,mod-2)%mod;
		return p;
	}
}
using namespace Polynomial;
int n;
string s;
ll inv[200200],rfact[200200];
ll ans[100100];
ll wl[100100],wr[100100];
using PointValue=vector<ll>;
PointValue evaluate(PointValue pv,int l,int r)
{
	int n=sz(pv);
	if(l<sz(pv)&&r>=0)
	{
		PointValue seg1,seg2,seg3;
		if(l<0) seg1=evaluate(pv,l,0);
		for(int i=max(l,0);i<=min(n-1,r);i++)
			seg2.pb(pv[i]);
		if(r>=sz(pv)) seg3=evaluate(pv,sz(pv),r);
		PointValue ans;
		for(auto x:seg1) ans.pb(x);
		for(auto x:seg2) ans.pb(x);
		for(auto x:seg3) ans.pb(x);
		return ans;
	}
	for(int i=0;i<n;i++)
	{
		pv[i]=pv[i]*rfact[n-1-i]%mod*rfact[i]%mod;
		if((n-i-1)&1) pv[i]=red(mod-pv[i]);
	}
	poly f(n+r-l);
	for(int j=0;j<sz(f);j++)
		f[j]=getinv(l-n+1+j);
	poly h=pv*f;
	ll value=1;
	for(int j=0;j<n;j++)
		value=value*(l-j)%mod;
	PointValue ret;
	for(int j=l;j<=r;j++)
	{
		ret.pb(h[n-1+j-l]*value%mod);
		value=value*(j+1)%mod*getinv(j-n+1)%mod;
	}
	return ret;
}
PointValue extend(PointValue pv,int n){return evaluate(pv,0,n-1);}
PointValue merge(PointValue A,PointValue B)
{
	int n=sz(A)+sz(B)-1;
	A=extend(A,n);
	B=extend(B,n);
	for(int i=0;i<n;i++)
		A[i]=A[i]*B[i]%mod;
	return A;
}
PointValue solveL(int l,int r)
{
	if(l==r)
	{
		if(s[l]=='L')
			return PointValue{red(mod-l+1),red(mod+2-l)};
		return PointValue{red(mod-l),red(mod+1-l)};
	}
	int mid=(l+r)/2;
	auto L=solveL(l,mid);
	auto R=solveL(mid+1,r);
	int have=0;
	for(int i=mid+1;i<=r;i++)
		if(s[i]=='L')
			have=1;
	if(have)
	{
		PointValue LR=evaluate(L,mid+1,r);
		for(int i=0;i<sz(LR);i++)
			wl[i+mid+1]=wl[i+mid+1]*LR[i]%mod;
	}
	if(r==n-1)
		return PointValue{1};
	return merge(L,R);
}
PointValue solveR(int l,int r)
{
	if(l==r)
	{
		if(s[l]=='R')
			return PointValue{l+1,l};
		return PointValue{l,red(l+mod-1)};
	}
	int mid=(l+r)/2;
	auto L=solveR(l,mid);
	auto R=solveR(mid+1,r);
	int have=0;
	for(int i=l;i<=mid;i++) if(s[i]=='R') have=1;
	if(have)
	{
		PointValue RL=evaluate(R,l,mid);
		for(int i=0;i<sz(RL);i++)
			wr[i+l]=wr[i+l]*RL[i]%mod;
	}
	if(!l)
		return PointValue{1};
	return merge(L,R);
}
char buf[1<<23],*p1=buf,*p2=buf,obuf[1<<23],*O=obuf;
void print(long long x) {
    if(x>9) print(x/10);
    *O++=x%10+'0';
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	init();
	rfact[0]=1;
	for(int i=1;i<100100;i++)
	{
		inv[i]=ksm(i,mod-2);
		rfact[i]=rfact[i-1]*inv[i]%mod;
	}
	cin>>n>>s;
	for(int i=0;i<n;i++)
		wl[i]=wr[i]=1;
	solveL(0,n-1);
	solveR(0,n-1);
	for(int i=0;i<n;i++)
		wl[i]=wl[i]*rfact[i+1]%mod;
	for(int i=0;i<n;i++)
		wr[i]=wr[i]*rfact[n-i]%mod;
	for(int i=0;i<=n;i++)
		if((!i||s[i-1]=='L')&&(i==n||s[i]=='R'))
		{
			ll ways=1;
			if(i) ways=ways*wl[i-1]%mod;
			if(i<n) ways=ways*wr[i]%mod;
			if(i)
				ans[i-1]=(ans[i-1]+ways)%mod;
			if(i<n)
				ans[i]=(ans[i]+ways)%mod;
		}
	ll fact=1;
	for(int i=1;i<=n;i++) fact=fact*i%mod;
	for(int i=0;i<n;i++)
	{
		print(ans[i]*fact%mod);
		*O++=' ';
	}
	fwrite(obuf,O-obuf,1,stdout);
	return 0;
}