#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

vector<string>memo(4100);
vector<int>po(20);

void dfs(int num,int depth,int left,string s) {
	if (num > 4094) return;
	int next1 = po[depth + 1] + 2 * left - 1;
	int next2 = po[depth + 1] + 2 * left;
	dfs(next1,depth+1,2*left,s + "L");
	dfs(next2,depth+1,2*left+1, s + "R");
	memo[num] = s;
}

int main() {
	po[0] = 1;
	rep(i, 1, 19) {
		po[i] = 2*po[i-1];
	}
	dfs(0,0,0,"");
	
	int m;
	cin >> m;
	rep(i, 0, m) {
		int a;
		cin >> a;
		cout << memo[a] << endl;
	}
	return 0;
}