#include "toxic.h"
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define lb(x) (x&-x)
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef pair<int,int> pii;
typedef vector<int>vi;
const int N=1003;
namespace AAA{
	int n,fa[N],T;
	bool vis[N];
	const pii p[50]={{0,1},{0,2},{0,3},{0,4},{0,5},{1,2},{0,6},{0,7},{0,8},{0,9},{1,4},{0,10},{2,2},{0,11},{0,12},{0,13},{1,6},{0,14},{0,15},{0,16},{0,17},{1,8},{0,18},{2,4},{0,19},{0,20},{0,21},{1,10},{0,22},{0,23},{3,2},{0,24},{1,12},{0,25},{0,26},{0,27},{2,6},{0,28},{1,14},{0,29},{0,30},{0,31},{0,32},{0,33},{1,16},{0,34},{0,35},{2,8}};
	inline int fd(pii A){
		rep(i,0,47)if(p[i]==A)return i;
		assert(0);
	}
	inline void init(){
		rep(i,0,n-1)fa[i]=i,vis[i]=1;
	}
	inline int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
	inline void red(vi &vec){
		vi A;
		for(int x:vec)if(x>=0&&x<n&&fa[x]==x)A.pb(x);
		vec=A;
	}
	inline vi qr(vi vec){
		return query_machine(vec);
	}
	inline int find1(){
		int d=0;
		while(1){
			vi vec(501,0);
			rep(i,1,499)vec.pb(i+d);
			red(vec);vi res=qr(vec);
			if(res.back()==vec.size()){
				rep(i,1,499)fa[i+d]=0;
				d+=499;
				continue;
			}
			if(res.back()>=501)return 0;
			int x=res.size();
			return x-500+d;
		}
	}
	inline void dec(vi &A){while(A.size()&&!A.back())A.pop_back();}
	inline void solve(vi vec){
		while(vec.size()<50)vec.pb(n);
		vi A;
		rep(i,1,19)A.pb(vec[48]);
		A.pb(T);
		rep(i,0,47)rep(j,1,1<<p[i].fi){
			rep(k,1,p[i].se)A.pb(vec[i]);
			A.pb(T);
		}
		rep(i,1,20)A.pb(vec[49]);
		red(A);
		int m=A.size();
		//for(int x:A)fprintf(stderr,"%d ",x);fprintf(stderr,"\n");
		A=qr(A);
		per(i,(int)A.size()-1,0)A[i]=(i?A[i-1]:m)-A[i];
		dec(A);
		//assert(A.size()<=20);
		if(A.size()==20){
			//assert(A[19]==1);
			vis[vec[49]]=0;
			rep(i,0,19)--A[i];
			dec(A);
		}
		//assert(A.size()<=19);
		if(A.size()==19){
			vis[vec[48]]=0;
			rep(i,0,18)--A[i];
			dec(A);
		}
		//assert(A.size()<=18);
		per(i,17,0)if(A.size()>i&&(A[i]&1)){
			pii ret=P(0,2*i+1);
			vis[vec[fd(ret)]]=0;
			rep(j,0,i-1)A[j]-=2;
			--A[i];
			dec(A);
		}
		//for(int x:A)assert(~x&1);
		//exit(0);
		while(A.size()){
			int m=A.size(),p=__lg(lb(A.back()))-1;
			pii ret=P(p,m*2);
			//fprintf(stderr,"%d %d %d\n",ret.fi,ret.se,m);
			//for(int x:A)fprintf(stderr,"%d ",x);fprintf(stderr,"\n");
			vis[vec[fd(ret)]]=0;
			rep(i,0,m-1)A[i]-=2<<p;
			dec(A);
		}
	}
	inline void solve(int nn){
		n=nn;init();
		T=find1();
		//cerr<<T; exit(0);
		vi vec;
		rep(i,0,n-1)if(i!=T&&fa[i]==i){
			vec.pb(i);
			if(vec.size()==50)solve(vec),vec.clear();
		}
		if(vec.size())solve(vec),vec.clear();
		vector<char>A;
		rep(i,0,n-1)A.pb(vis[i]?'T':'R');
		answer_type(A);
	}
}
void determine_type(int n) {
	AAA::solve(n);
}