/* ?????? ?????? ?????? ?????? D P ???? ?????? ?????? ?????? ?????? ??? l l? ?????? ?????? ?? OI ?? ?????? */ #include using namespace std; //#define int long long //#define eps 1e-9 //#define ENF 1e13 const int N=1e4; const int mod=1e9+7; inline int read() { int x=0,f=1;char ch=getchar(); while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();} while (ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-48;ch=getchar();} return x*f; } void write(int x) { if(x<0)putchar('-'),x=-x; if(x<10)putchar(x+'0'); else write(x/10),putchar(x%10+'0'); } int c[N]; int f[N]; int son[N][2]; void dfs(int u,int fa){ if(u>4094)return; f[u]=fa; son[u][0]=u*2+1; son[u][1]=u*2+2; dfs(son[u][0],u); dfs(son[u][1],u); } signed main(){ // freopen("path.in","r",stdin); // freopen("path.out","w",stdout); dfs(0,0); int m=read(); while(m--){ int a=read(); int now=a; string s; while(now!=0){ int nnow=f[now]; if(son[nnow][0]==now) s+="L"; else s+="R"; now=nnow; } reverse(s.begin(),s.end()); cout<