#include <bits/stdc++.h>
#include<bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
int n ;
string s;
int ans[100005] , sol[100005];
const int mod = 998244353;
int t[100005] , rt[100005];
const int G = 3;
int ln[100005] ;
int ft[100005];

const int P=998244353;

using poly=vector<int>;
const int N=5e5+1e3+7;
template<int P>
int qpow(int a,int b)
{
    int ret=1;
    while(b)
    {
        if(b&1)
            ret=1ll*ret*a%P;
        b>>=1;
        a=1ll*a*a%P;
    }
    return ret;
}
namespace Core {
    int a[N],b[N],w[N],rev[N];
    template<int P>
    inline void NTT(int *a,int len)
    {
        for(int i=1;i<len;i++)
            if(i>rev[i])
                swap(a[i],a[rev[i]]);
        for(int d=1;d<len;d<<=1)
            for(int m=d<<1,i=0;i<len;i+=m)
                for(int j=0;j<d;j++)
                {
                    int x=a[i+j],y=1ll*a[i+j+d]*w[len/m*j]%P;
                    a[i+j]=(x+y>=P?x+y-P:x+y);
                    a[i+j+d]=(x-y<0?x-y+P:x-y);
                }
    }
};

template<int P>
poly mul(const poly &va,const poly &vb)
{
    using namespace Core;
    int len=1;
    while(len<(int)va.size()+(int)vb.size()-1)
        len<<=1;
    for(int i=0;i<len;i++)
        a[i]=(i<(int)va.size()?va[i]:0),b[i]=(i<vb.size()?vb[i]:0);
    for(int i=1;i<len;i++)
        rev[i]=rev[i>>1]>>1|(i&1?len>>1:0);
    w[0]=1;
    w[1]=qpow<P>(3,(P-1)/len);
    for(int i=2;i<len;i++)
        w[i]=1ll*w[i-1]*w[1]%P;
    NTT<P>(a,len);
    NTT<P>(b,len);
    for(int i=0;i<len;i++)
        a[i]=1ll*a[i]*b[i]%P;
    reverse(a+1,a+len);
    NTT<P>(a,len);
    poly c((int)va.size()+(int)vb.size()-1);
    for(int i=0,invlen=qpow<P>(len,P-2);i<(int)c.size();i++)
        c[i]=1ll*a[i]*invlen%P;
    return c;
}

const int mod1 = 998244353 , mod2 = 1004535809 , mod3 = 469762049;

typedef __int128 i128 ;
i128 exgcd(i128 a, i128 b, i128 &x, i128 &y) {
    if(!b) {
        x = 1, y = 0;
        return a;
    }
    i128 g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}
i128 crt(i128 a,i128 m,i128 b,i128 n) {
    if(n > m) swap(a , b) , swap(m , n) ;
    i128 x,y,g = exgcd(m , n , x , y) ;
    assert((a - b) % g == 0) ;
    x = (b - a) % n * x % n / g * m + a;
    return (x < 0 ? x + m * n / g : x) ;
}
poly rmul(const poly&a ,const poly& b) {
    poly c1 = mul<998244353>(a , b) ;
    poly c2 = mul<1004535809>(a , b) ;
    poly c3 = mul<469762049>(a , b) ;

    poly sol(c1.size()) ;
    for(int i = 0;i < c1.size();i++) {
        i128 a = crt(c1[i] , mod1 , c2[i] , mod2) ;
        i128 b = crt(a , (i128)mod1 * mod2 , c3[i] , mod3) ;
        sol[i] = (b % 998244352) ;
    }
    return sol;
}

int fpow(int a,int b) {
    int ans = 1;
    while(b) {
        if(b & 1) ans = 1LL * ans * a % mod;
        a = 1LL * a * a %mod ; b >>= 1;
    }
    return ans;
}

const int B = 5e6 ;

struct gsm {
    int p[N + 5] , pn[N + 5];
    int inv[N + 5] , invn[ N + 5];
    void init(int x) {
        p[0] = 1;
        for(int i = 1;i <= N;i++) p[i] = 1LL * p[i - 1] * x % mod;
        pn[0] = 1;
        for(int i = 1;i <= N;i++) pn[i] = 1LL * pn[i - 1] * p[N] % mod;

        int r = fpow(x , mod - 2);
        inv[0] = invn[0] = 1;
        for(int i = 1;i <= N;i++) inv[i] = 1LL * inv[i - 1] * r % mod;
        for(int i = 1;i <= N;i++) invn[i] = 1LL * invn[i - 1] * inv[N] % mod;
    }
    int qpow(int x) {
        return 1LL * pn[x / N] * p[x % N] % mod;
    }
    int qinv(int x) {
        return 1LL * invn[x / N] * inv[x % N] % mod;
    }
}g3;

namespace L{
    static int p[] = {2,7,17} ;
    static int k[] = {23,1,1} ;
    vector<int> pr[3];
    const int L = 512;
    int cc[3][L];
    void init() {
        g3.init(3) ;
        for(int i = 0;i < 3;i++) {
            pr[i].resize(k[i] + 1) ;
            pr[i][0] = 1;
            for(int j = 1;j <= k[i];j++) pr[i][j] = pr[i][j - 1] * p[i] ;
            memset(cc[i] , -1 , sizeof(cc[i])) ;

            int c = g3.qpow((mod - 1) / p[i]) , val = 1;
            for(int j = 0;j < p[i];j++) {
                assert(cc[i][val % L] == -1);
                cc[i][val % L] = j;
                val = 1LL * val * c % mod;
            }
        }
    }
    int ln(int b) {
        if(b == 0) return -1;
        // assert(b > 0 && b < mod) ;
        int ans[3];
        for(int i = 0;i < 3;i++) {
            int &x = ans[i];
            x = 0;


            for(int r = 1 ; r <= k[i] ; r++) {
                int d = g3.qinv( (1LL * x * (mod - 1)/pr[i][r]) % (mod - 1) ) , dr = 1LL * fpow(b , (mod - 1) / pr[i][r]) * d % mod; 
                // printf("R %d : %d %d %d\n",r,x,d,dr) ;
                // assert(cc[i].count(dr)) ;
                x += cc[i][dr % L] * pr[i][r - 1] ;
            }
        }

        int sol = (981467137LL * ans[0] + 427819008LL * ans[1] + 587202560LL * ans[2]) % (mod - 1);
        return sol ;
    }
}

void bsgs() {
    L::init() ;
    for(int i = 1;i <= n + 1;i++) ln[i] = L::ln(i) ;
    
    // for(int i = 1;i <= n + 1;i++) printf("%d %d\n",i,ln[i]) ;
    for(int i = 1;i <= n;i++) ft[i] = (ln[i + 1] - ln[i] + mod-1) % (mod - 1) ;

}

int C(int a,int b) {
    return 1LL * t[a] * rt[b] % mod * rt[a-b] % mod;
}
void calc(string s) {
    poly f(n + 1) , g(n + 1) ;
    for(int i = 1;i <= n;i++) {
        ans[i] = 0;
        if(s[i] == 'L') f[i] = 1;
        g[i] = ft[i] ;
    }
    poly c = rmul(f , g) ;
    for(int i = 1;i <= n;i++) {
        ans[i] = c[i] ;
    }
    for(int i = 0;i <= n;i++) f[i] = g[i] = 0;
    for(int i = 1;i <= n;i++) {
        if(i >= 2) g[n - i] = ft[i - 1];
        if(s[i] == 'R') f[i] = 1;
    }
    c = rmul(f , g) ;
    for(int i = 1 ; i <= n;i++) {
        if(s[i] != 'L') {ans[i] = 0;continue ;}
        if(i != n && s[i + 1] == 'L') {ans[i] = 0 ; continue ;}

        ans[i] = (ans[i] + c[i + n]) % (mod - 1) ;
        ans[i] = fpow(G , ans[i]) ;

        ans[i] = 1LL * ans[i] * t[i - 1] % mod;
        if(i != n) ans[i] = 1LL * ans[i] * t[n - i - 1] % mod;
        ans[i] = 1LL * ans[i] * C(n , i) % mod;
        // printf("I %d %d\n",i,ans[i]) ;
    }
    // for(int i = 1;i <= n;i++) {
    //     ans[i] = 0;
    //     if(s[i] == 'R') continue ;
    //     if(i != n && s[i + 1] == 'L') continue ;
    //     int sr = 1 , sl = 1;
    //     for(int j = i + 1 ;j <= n;j++) {
    //         if(s[j] == 'R') sr = 1LL * sr * (1 + fpow(j - i - 1 , mod - 2)) % mod;
    //     }
    //     for(int j = i - 1;j >= 1;j--) {
    //         if(s[j] == 'L') sl = 1LL * sl * (1 + fpow(i - j , mod - 2)) % mod;
    //     }
    //     sr = 1LL * sr * t[n-i] % mod * fpow(n - i , mod - 2) % mod;
    //     if(i == n) sr = 1;
    //     sl = 1LL * sl * t[i] % mod * fpow(i , mod - 2) % mod;
    //     ans[i] = 1LL * sl * sr % mod * C(n , i) % mod;
    // }
}
mt19937 rnd(0) ;
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    cin >> n >> s;
    // n = 1e5 ;
    // for(int i = 1;i <= n;i++) {
    //     if(rnd()%2) s += 'L' ;
    //     else s += 'R' ;
    // }
    t[0] = rt[0] = 1;
    for(int i = 1 ; i <= n;i++) t[i] = 1LL * t[i - 1] * i % mod , rt[i] = fpow(t[i] , mod - 2) ;
    bsgs() ;
    

    s = "#" + s;
    calc(s) ;
    for(int i = 1;i <= n;i++) sol[i] = ans[i] ;
    
    for(int i = 1;i <= n - i + 1;i++) swap(s[i] , s[n - i + 1]) ;
    for(int i = 1;i <= n;i++) s[i] ^= ('L' ^ 'R') ;
    calc(s) ;
    for(int i = 1; i<= n;i++) sol[n - i + 1] = (sol[n - i + 1]+ans[i]) % mod;
    for(int i = 1;i <= n;i++) cout << sol[i] <<' ' ;
    cout << '\n';
}