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

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)

const int INF = 1e8;
const int MOD = 1e9+7;

typedef long long ll;

int main(void) {
    int i, m;
    cin >> m;
    rep (i,m) {
        int a;
        cin >> a;
        string ans;
        while (a) {
            if (a % 2) ans.push_back('L');
            else ans.push_back('R');
            a = (a - 1) / 2;
        }
        reverse(ans.begin(),ans.end());
        cout << ans << endl;
    }
    return 0;
}