#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

#include "atcoder/convolution"
#include "atcoder/modint"

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

using mint = atcoder::modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    string S;
    cin >> N >> S;

    auto dfs = [&](auto self, int l, int r) -> vector<vector<vector<mint>>> {
        vector res(2, vector(2, vector<mint>(r - l + 1, 0)));
        if (r - l == 1) {
            int x = S[l] == 'B';
            res[0][1][0]++;
            res[1][0][0]++;
            res[x][x][1]++;
            return res;
        }
        int m = (l + r) >> 1;
        auto L = self(self, l, m);
        auto R = self(self, m, r);
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 2; j++) {
                for (int k = 0; k < 2; k++) {
                    auto v = atcoder::convolution(L[i][j], R[j ^ 1][k]);
                    for (int p = 0; p < int(v.size()); p++) res[i][k][p] += v[p];
                }
            }
        }
        return res;
    };

    auto ans = dfs(dfs, 0, N);
    for (int i = 1; i <= N; i++) {
        mint sum = 0;
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                sum += ans[j][k][i];
            }
        }
        cout << sum.val() << '\n';
    }
    return 0;
}