#include <iostream>
using namespace std;

#define MAX (4094)

int M;
int tree[MAX + 1];

void make_tree(int n, int m, int l)
{
    if (n >= MAX) {
        return;
    }
    int i = 0;
    for (; i < (1 << l); i++) {
        tree[n + i] = m + (i / 2);
    }
    make_tree(n + i, n, l + 1);
}

void solve(int n)
{
    char ans[256];
    int num = 0;
    while (n > 0) {
        if (n % 2) {
            ans[num++] = 'L';
        }
        else {
            ans[num++] = 'R';
        }
        n = tree[n];
    }
    for (; num > 0; num--) {
        cout << ans[num-1];
    }
    cout << endl;
}

int main()
{
    cin >> M;
    tree[0] = -1;
    make_tree(1, 0, 1);
    while (M--) {
        int a;
        cin >> a;
        solve(a);
    }
}