#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <list>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(d) string(1,d)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
  vector<string> vs(20005,"");
  int mn = 0;
  queue<int> q;
  q.push(mn);
  while(1){
    int a = q.front();
    q.pop();
    if(a>=5000)break;
    vs[mn+1]=vs[a]+"L";
    vs[mn+2]=vs[a]+"R";
    q.push(mn+1);
    q.push(mn+2);
    mn += 2;
  }
  int m;
  cin>>m;
  rep(i,0,m){
    int a;
    cin>>a;
    cout << vs[a] << endl;
  }
  return 0;
}