#include <iostream>
#include <queue>
#include <utility>
using namespace std;

typedef pair<int, string> P;

int m;
string paths[5000];

int main() {
    cin >> m;

    int id = 0;
    queue<P> que;
    que.push(P(0, paths[0]));
    paths[0] = "";

    while (!que.empty()) {
        P node = que.front(); que.pop();
        if (id + 1 > 4094) continue;
        que.push(P(++id, node.second + "L"));
        paths[id] = node.second + "L";
        que.push(P(++id, node.second + "R"));
        paths[id] = node.second + "R";
    }

    for (int i = 0; i < m; i++) {
        int a;
        cin >> a;
        cout << paths[a] << endl;
    }

    return 0;
}