// No.392 2分木をたどれ
// https://yukicoder.me/problems/no/392
// AC

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

vector<string> solve(vector<int> &queries);


int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    unsigned int m;
    cin >> m;
    vector<int> queries(m);
    for (int i = 0; i < m; ++i)
        cin >> queries[i];

    vector<string> ans = solve(queries);
    for (auto a: ans)
        cout << a << endl;
}

vector<string> solve(vector<int> &queries) {
    vector<string> routes(4095);
    routes[0] = "";
    for (int i = 1; i < 4095; ++i) {
        int parent = (i - 1) / 2;
        string me;
        if (i == parent * 2 + 1)
            me = "L";
        else
            me = "R";
        routes[i] = routes[parent] + me;
    }

    vector<string> ans;
    for (auto q: queries)
        ans.push_back(routes[q]);
    return move(ans);
}