#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- const int mo=998244353; ll modpow(ll a, ll n = mo-2) { ll r=1; a%=mo; while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1; return r; } template using vec=vector; //using vec=valarray; template vec fft(vec v, bool rev=false) { int n=v.size(),i,j,m; for(int m=n; m>=2; m/=2) { T wn=modpow(5,(mo-1)/m); if(rev) wn=modpow(wn); for(i=0;i=mo) v[j1]-=mo; w=(ll)w*wn%mo; } } } for(i=0,j=1;j>1;k>(i^=k);k>>=1); if(i>j) swap(v[i],v[j]); } if(rev) { ll rv = modpow(n); FOR(i,n) v[i]=(ll)v[i]*rv%mo; } return v; } template vec MultPoly(vec P,vec Q,bool resize=false) { if(resize) { int maxind=0,pi=0,qi=0,i; int s=2; FOR(i,P.size()) if(norm(P[i])) pi=i; FOR(i,Q.size()) if(norm(Q[i])) qi=i; maxind=pi+qi+1; while(s*2 R(s*2); for(int x=0;x<=pi;x++) for(int y=0;y<=qi;y++) (R[x+y]+=P[x]*Q[y])%=mo; return R; } vec P2(s*2),Q2(s*2); FOR(i,pi+1) P2[i]=P[i]; FOR(i,qi+1) Q2[i]=Q[i]; swap(P,P2),swap(Q,Q2); } P=fft(P), Q=fft(Q); for(int i=0;i vec AddPoly(vec P,vec Q) { if(P.size()>> Q; queue>> Q2; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>S; FOR(i,N) { vector> V(4); V[0]=V[3]={1}; if(S[i]=='R') { V[1]={0,1}; V[2]={0}; } else { V[1]={0}; V[2]={0,1}; } Q.push(V); } while(Q.size()>1) { cout<> V(4); while(Q.size()>=2) { auto a=Q.front(); Q.pop(); auto b=Q.front(); Q.pop(); V[0]=AddPoly(MultPoly(a[0],b[0],1),MultPoly(a[1],b[2],1)); V[1]=AddPoly(MultPoly(a[0],b[1],1),MultPoly(a[1],b[3],1)); V[2]=AddPoly(MultPoly(a[2],b[0],1),MultPoly(a[3],b[2],1)); V[3]=AddPoly(MultPoly(a[2],b[1],1),MultPoly(a[3],b[3],1)); Q2.push(V); } if(Q.size()) Q2.push(Q.front()); swap(Q,Q2); } vector> R=Q.front(); FORR(a,R) { FOR(i,a.size()) (ret[i]+=a[i])%=mo; } for(i=1;i<=N;i++) cout<