#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main() {
  int m;
  cin >> m;
  vector<int> c(m);
  for (int i=0; i<m; i++) {
    cin >> c[i];
  }


  int tree = 4093;
  
  for (int i=0; i<m; i++) {
    int tmp = c[i];
    string ans = "";
    
    while (tmp!=0) {
      if (tmp%2 == 1)  {
        tmp = (tmp-1) / 2;
        ans += "L";
      } else {
        tmp = (tmp-2) / 2;
        ans += "R";
      }
    }

    reverse(ans.begin(), ans.end());
    cout << ans << endl;
  }
}