#include<bits/stdc++.h>
using namespace std;
#define N 3005
typedef long long ll;
ll f[N][N],ans[N*2];
int n;
char s[N];
#define mod 998244353
int main(){
    // freopen("d3t1.in","r",stdin);
    // freopen("d3t1.out","wb",stdout);
    scanf("%d",&n);
    scanf("%s",s+1);
    f[0][0]=1;
    int cntr=(s[1]=='R');
    int cntb=(s[1]=='B');
    for(int i=2;i<=n;i++){
        if(s[i]=='R'){
            for(int p=0;p+p<i;p++)for(int q=(i-1>>1);q>=0;q--)if(f[p][q]){
                ll v=f[p][q];
                f[p][q+1]+=v*(cntb-q);
                if(p)f[p-1][q]+=v*p;
                f[p][q]=f[p][q]*(cntr+q-p)%mod;
            }
            ++cntr;
        }
        if(s[i]=='B'){
            for(int p=(i-1>>1);p>=0;p--)for(int q=0;q+q<i;q++)if(f[p][q]){
                ll v=f[p][q];
                f[p+1][q]+=v*(cntr-p);
                if(q)f[p][q-1]+=v*q;
                f[p][q]=f[p][q]*(cntb+p-q)%mod;
            }
            ++cntb;
        }
    }
    for(int p=0;p+p<=n;p++)for(int q=0;q+q<=n;q++)ans[-p-p+q+n]+=f[p][q]%mod;
    for(int i=0;i<=n+n;i++)printf("%d ",ans[i]%mod);
    return 0;
}