#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

string ans[4100];

void dfs(int n, const string& str){
  if(n>0) ans[n] = str;
  if(2*n+1<=4094) dfs(2*n+1, str + "L");
  if(2*n+2<=4094) dfs(2*n+2, str + "R");
}

int main(){
  ios::sync_with_stdio(false);

  dfs(0, "");

  int m;
  cin >> m;
  rep(i,m){
    int A;
    cin >> A;
    cout << ans[A] << endl;
  }
  return 0;
}