#include<bits/stdc++.h>
#include<atcoder/all>

using namespace std;

using int64 = long long;
constexpr int mod = 998244353;
constexpr int64 infll = (1LL << 62) - 1;
constexpr int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template<typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template<typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template<typename... Args>
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template<typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}

int main() {
  int N;
  cin >> N;
  string S;
  cin >> S;
  for(auto& s : S) s = (s == 'R');
  using mint = atcoder::modint998244353;
  using V = vector< mint >;
  auto rec = MFP([&](auto rec, int l, int r) -> array< array< V, 2 >, 2 > {
    int sz = r - l;
    array< array< V, 2 >, 2 > dp;
    for(int i = 0; i < 2; i++) {
      for(int j = 0; j < 2; j++) {
        dp[i][j] = V(sz + 1, 0);
      }
    }
    if(sz == 1) {
      dp[S[l]][S[l]][1] = 1;
    } else {
      auto L = rec(l, (l + r) / 2);
      auto R = rec((l + r) / 2, r);
      for(int i = 0; i < 2; i++) {
        for(int j = 0; j < 2; j++) {
          for(int x = 0; x < L[i][j].size(); x++) {
            dp[i][j][x] += L[i][j][x];
          }
          for(int x = 0; x < R[i][j].size(); x++) {
            dp[i][j][x] += R[i][j][x];
          }
          for(int k = 0; k < 2; k++) {
            auto C = atcoder::convolution(L[i][j], R[1 ^ j][k]);
            for(int x = 0; x < C.size(); x++) {
              dp[i][k][x] += C[x];
            }
          }
        }
      }
    }
    return dp;
  });
  auto ans = rec(0, N);
  for(int i = 1; i <= N; i++) {
    cout << (ans[0][0][i] + ans[0][1][i] + ans[1][0][i] + ans[1][1][i]).val() << "\n";
  }
}