#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define BIT(i,j) (((i)>>(j))&1LL) #define MASK(i) (1LL<<(i)) #define ALL(x) (x).begin(),(x).end() #define SZ(x) (int)(x).size() #define fi first #define se second #define ull unsigned long long #define ll long long #define ld long double #define vi vector #define vvi vector #define vvvi vector #define pii pair #define vpii vector #define vvpii vector #define endl "\n" #define MP make_pair #define int ll //------------------------------------------------------------------------------------------------// template bool mini(T1 &a, T2 b){if(a>b){a=b;return true;}return false;} template bool maxi(T1 &a, T2 b){if(a T gcd(T a, T b) { while(b) { a %= b; swap(a,b); } return a; } template T lcm(T a, T b) { return a/gcd(a,b)*b; } //-----------------------------------------------------------------------------------------------// const ll LINF = 1e18; const int INF = 1e9; const int LOG = 20; const int MAXN = 1e5+7; const int N = 1e2+3; const int MOD = 998244353; const int BASE = 1e5; const ld EPS = 1e-9; const ld PI = acos(-1); const int OFFSET = 1e3; //------------------------------------------------------------------------------------------------// void add(int &a, int b){ a += b; if(a>=MOD) a -= MOD; } int dp[MAXN][2]; void solve(){ int n; cin >> n; string s; cin >> s; s = " "+s; /* R = 0 B = 1 */ dp[0][1] = dp[0][0] = 1; dp[1][s[1]=='B'] = 1; for(int i = 2; i<=n; i++){ int c = s[i]=='B'; for(int j = 1; j<=i; j++){ add(dp[j][c],dp[j-1][c^1]); } } for(int i = 1; i<=n; i++){ int res = 0; add(res,dp[i][0]); add(res,dp[i][1]); cout << res << endl; } } signed main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "test" if(fopen(task".inp","r")){ freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } #define task1 "nothing" if(fopen(task1".inp","r")){ freopen(task1".inp","r",stdin); freopen(task1".out","w",stdout); } int test = 1; while(test--){ solve(); } cerr << "\nTime elapsed: " << 1000*clock()/CLOCKS_PER_SEC << "ms\n"; return 0; } /** /\_/\ * (= ._.) * / >TL \>AC **/