#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = pair; using func = ll; val op(val a, val b) { return MP(a.first + b.first, a.second + b.second); } val e() { return MP(0, 0); } val mp(func f, val a) { return MP(a.first + f * a.second, a.second); } func comp(func f, func g) { return f + g; } func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; ll n; string s; //BB,BR,RB,RR tuple, vector, vector, vector> solve2(ll l, ll r) { if (r - l == 1) { vector e = { 0 }; vector r = { 0,1 }; if (s[l] == 'B') { return make_tuple(r, e, e, e); } else { return make_tuple(e, e, e, r); } } ll m = (l + r) / 2; auto [bbl, brl, rbl, rrl] = solve2(l, m); auto [bbr, brr, rbr, rrr] = solve2(m, r); vector bbrb = convolution(bbl, rbr); vector bbrr = convolution(bbl, rrr); vector brbb = convolution(brl, bbr); vector brbr = convolution(brl, brr); vector rbrb = convolution(rbl, rbr); vector rbrr = convolution(rbl, rrr); vector rrbb = convolution(rrl, bbr); vector rrbr = convolution(rrl, brr); vector bb(max(bbrb.size(), brbb.size())); vector br(max(bbrr.size(), brbr.size())); vector rb(max(rbrb.size(), rrbb.size())); vector rr(max(rbrr.size(), rrbr.size())); REP(i, bbrb.size()) bb[i] += bbrb[i]; REP(i, brbb.size()) bb[i] += brbb[i]; REP(i, rbrb.size()) rb[i] += rbrb[i]; REP(i, rrbb.size()) rb[i] += rrbb[i]; REP(i, bbrr.size()) br[i] += bbrr[i]; REP(i, brbr.size()) br[i] += brbr[i]; REP(i, rbrr.size()) rr[i] += rbrr[i]; REP(i, rrbr.size()) rr[i] += rrbr[i]; REP(i, bbl.size()) bb[i] += bbl[i]; REP(i, bbr.size()) bb[i] += bbr[i]; REP(i, rbl.size()) rb[i] += rbl[i]; REP(i, rbr.size()) rb[i] += rbr[i]; REP(i, brl.size()) br[i] += brl[i]; REP(i, brr.size()) br[i] += brr[i]; REP(i, rrl.size()) rr[i] += rrl[i]; REP(i, rrr.size()) rr[i] += rrr[i]; return make_tuple(bb, br, rb, rr); } void solve() { cin >> n >> s; auto [bb, br, rb, rr] = solve2(0, n); bb.resize(n + 1); br.resize(n + 1); rb.resize(n + 1); rr.resize(n + 1); REP(i, n) { cout << (bb[i + 1] + br[i + 1] + rb[i + 1] + rr[i + 1]).val() << endl; } return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }