#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

#include "atcoder/modint.hpp"
#include "atcoder/convolution.hpp"
using mint = atcoder::modint998244353;
using fps = vector<mint>;
fps fplus (const fps &a, const fps &b){
    int sa = a.size(), sb = b.size();
    fps c(max(sa,sb));
    rep(i,c.size()){
        if(i < sa) c[i] += a[i];
        if(i < sb) c[i] += b[i];
    }
    return c;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; string s; in(n,s);
    vector<array<fps,4>> p;
    vector<array<fps,4>> q;
    array<fps,4> z;
    z[0] = z[3] = {1};
    rrep(i,n) {
        if(s[i] == 'R'){
            z[1] = {0,1};
            z[2] = {0};
        }
        else{
            z[2] = {0,1};
            z[1] = {0};
        }
        p.pb(z);
    }

    while(p.size() > 1) {
        int m = p.size();
        rep(i, m/2) {
            auto &x = p[i*2];
            auto &y = p[i*2+1];
            z[0] = fplus(atcoder::convolution(x[0],y[0]),
                        atcoder::convolution(x[1],y[2]));
            z[1] = fplus(atcoder::convolution(x[0],y[1]),
                        atcoder::convolution(x[1],y[3]));
            z[2] = fplus(atcoder::convolution(x[2],y[0]),
                        atcoder::convolution(x[3],y[2]));
            z[3] = fplus(atcoder::convolution(x[2],y[1]),
                        atcoder::convolution(x[3],y[3]));
            q.pb(z);
        }
        if(m&1) q.pb(p.back());
        swap(p,q);
        q.clear();
    }

    FOR(i,1,n+1){
        mint ans = 0;
        rep(j,4) if(i < p.front()[j].size()) ans += p.front()[j][i];
        out(ans.val());
    }
}