func_code_string: #include <bits/stdc++.h>   using namespace std;   #define INF 200000000000000000LL   typedef long long int ll;   typedef pair<ll,ll> ii;   typedef pair<ii,ll> iii;   typedef vector<ll> vi;   typedef vector<ii> vii;   #define getbit(n,i) (((n)&(1LL<<(i)))!=0)   #define setbit0(n,i) ((n)&(~(1LL<<(i))))   #define setbit1(n,i) ((n)|(1LL<<(i)))   #define lastone(n) ((n)&(-(n)))   #define read freopen( debug//in.txt , r ,stdin)   #define write freopen( debug//out.txt , w ,stdout)   #define DBG(a) cerr<<#a<<  ->->->->  <<a<<  n    #define fi first   #define se second   #define PI (acos(-1))   #define fastread ios::sync_with_stdio(false);cin.tie(NULL)   mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());   #define mod (1000000007)   #define asz 500005   template<class T,class V> ostream& operator<<(ostream &s,pair<T,V> a)   {       s<<a.fi<<   <<a.se;       return s;   }   const int N = 1e3+5;   int main()   {       fastread;   #ifdef FILE_IO       read;       write;   #endif          int T=1;       cin>>T;       for(int qq=1; qq<=T; qq++)       {           int n;           string s;           cin>>n>>s;           vi l(n+2),r(n+2);           r[n] = 1;           r[n-1] = 1 + (s.back() ==  R );           l[0] = 1;           l[1] = 1 + (s[0] ==  L );           for(int i=2;i<=n;i++){               if(s[i-1] ==  L ){                   if(s[i-2] ==  R )l[i] = 2+l[i-2];                   else l[i] = 2;               }               else l[i] = 1;                  if(s[n-i] ==  R ){                   if(s[n-i+1] ==  L )r[n-i] = 2+r[n-i+2];                   else r[n-i] = 2;               }               else r[n-i] = 1;           }              for(int i=0;i<=n;i++)cout<<l[i]+r[i]-1<<   ;           cout<<endl;       }   }      