#include #include #define rep(i, n) for (i = 0; i < n; i++) #define left 0 #define right 1 int follow(int s, int r) { int i, a = s; if (r == left) a = 2 * a + 1; else if (r == right) a = 2 * a + 2; return a; } int getbit(int x, int n) { return !!(x & (int)pow(2, n - 1)); } int main() { int m; scanf("%d", &m); int a[4094], i; rep(i, m) scanf("%d", &a[i]); int j, k, l; rep(i, m) rep(l, 12) rep(j, pow(2, l)) { int t = 0, ans[11]; rep(k, l) { ans[k] = getbit(j, k + 1); t = follow(t, ans[k]); } if (t == a[i]) { rep(k, l) printf("%c", ans[k] == left ? 'L' : 'R'); printf("\n"); break; } } return 0; }