#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<mint> add(const vector<mint> &x, const vector<mint> &y) {
	int sz = max(x.size(), y.size());
	vector<mint>ret(sz);
	rep(i, x.size())ret[i] += x[i];
	rep(i, y.size())ret[i] += y[i];
	return ret;
}
vector<vector<vector<mint>>> mul(vector<vector<vector<mint>>>&A, vector<vector<vector<mint>>>&B) {
	vector<vector<vector<mint>>> C(A.size(), vector<vector<mint>>(B[0].size(), { 0 }));
	for (int i = 0; i < (int)A.size(); ++i) {
		for (int j = 0; j < (int)B.size(); ++j) {
			for (int k = 0; k < (int)C.size(); ++k) {
				C[i][j] = add(C[i][j], convolution(A[i][k], B[k][j]));
			}
		}
	}
	return C;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	string s; cin >> s;
	reverse(all(s));
	vector<vector<vector<mint>>> vr = {
		{{1},{0,1} },
		{{0},{1}}
	};
	vector<vector<vector<mint>>> vb = {
		{{1},{0} },
		{{0,1},{1}}
	};
	auto dfs = [&](auto self, int l, int r)->vector<vector<vector<mint>>> {
		if (r - l == 1) {
			if ('R' == s[l])return vr;
			else return vb;
		}
		int m = (l + r) / 2;
		auto vl = self(self, l, m);
		auto vr = self(self, m, r);
		return mul(vl, vr);
	};
	auto get = dfs(dfs, 0, n);
	auto dp0 = add(get[0][0], get[0][1]);
	auto dp1 = add(get[1][0], get[1][1]);
	dp0.resize(n + 1);
	dp1.resize(n + 1);
	rep2(i, 1, n + 1) {
		mint val = dp0[i] + dp1[i];
		cout << val.val() << endl;
	}
	return 0;
}