#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e5+5,M=N*4+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
char s[N];
ll inv[N],f1[N],f2[N],frc[N],frv[N];
ll C(int x,int y){return frc[x]*frv[y]%mod*frv[x-y]%mod;}
void Solve(){
	scanf("%d%s",&n,s+1);
	inv[1]=1;for(int i=2;i<=n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(int i=frc[0]=frv[0]=1;i<=n;i++) frc[i]=frc[i-1]*i%mod,frv[i]=frv[i-1]*inv[i]%mod;
	f1[0]=1;
	for(int i=1;i<=n;i++)if(s[i]=='L'){
		f1[i]=frc[i-1];
		for(int j=1;j<i;j++) if(s[j]=='L') f1[i]=f1[i]*(1+inv[i-j])%mod;
	}
	f2[n+1]=1;
	for(int i=n;i;i--) if(s[i]=='R'){
		f2[i]=frc[n-i];
		for(int j=i+1;j<=n;j++) if(s[j]=='R') f2[i]=f2[i]*(1+inv[j-i])%mod;
	}
	s[0]='L';s[n+1]='R';
	for(int i=1;i<=n;i++){
		ll w=0;
		if(s[i]=='L'&&s[i+1]=='R') w=f1[i]*f2[i+1]%mod*C(n,i)%mod;
		if(s[i]=='R'&&s[i-1]=='L') w=f1[i-1]*f2[i]%mod*C(n,i-1)%mod;
		printf("%lld%c",w," \n"[i==n]);
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}