#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
	F f;

  public:
	y_combinator(F&& f) : f(std::forward<F>(f)) {}
	template <class... Args> auto operator()(Args &&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back

#include <atcoder/segtree>
#include <atcoder/convolution>
#include <atcoder/modint>
using mint = atcoder::modint998244353;
using S = array<array<vector<mint>,2>, 2>;
vector<mint> add(const vector<mint>& A, const vector<mint>& B) {
	vector<mint> C(max(A.size(), B.size()));
	rep(i, A.size()) C[i] += A[i];
	rep(i, B.size()) C[i] += B[i];
	return C;
}
S op(S a, S b) {
	S res{};
	rep(i, 2) rep(k, 2) rep(j, 2) res[i][j] = add(res[i][j], atcoder::convolution(a[i][k], b[k][j]));
	return res;
}
S e() {
	S res{};
	res[0][0] = res[1][1] = {1};
	res[1][0] = res[0][1] = {0};
	return res;
}

void run_case() {
	int N;
	string T;
	cin >> N >> T;
	reverse(all(T));
	S R{}, B{};
	R[0][0] = B[0][0] = R[1][1] = B[1][1] = {1};
	R[1][0] = B[0][1] = {0};
	R[0][1] = B[1][0] = {0, 1};
	vector<S> init(N);
	rep(i, N) {
		init[i] = (T[i] == 'R' ? R : B);
	}
	atcoder::segtree<S, op, e> seg(init);
	S res = seg.all_prod();
	rep(i, N) {
		mint ans = 0;
		rep(j, 2) rep(k, 2) ans += (i+1 < res[j][k].size() ? res[j][k][i+1] : 0);
		cout << ans.val() << "\n";
	}
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::fixed(std::cout).precision(16);
	int T = 1;
 	//cin >> T;
	while(T--) run_case();
	return 0;
}