#include <bits/stdc++.h>

using namespace std;

class Node {
 public:
  int parent;
  int n;
  char c;

  Node(int parent, int n, char c) : parent(parent), n(n), c(c) {}
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int M;
  cin >> M;
  vector<int> A(M);
  for (auto&& e : A) {
    cin >> e;
  }
  Node* root = new Node(0, 0, '$');
  vector<Node*> nodes;
  nodes.emplace_back(root);
  queue<Node*> que;
  que.push(root);
  int n = 0;
  while (n < 5000) {
    auto node = que.front();
    que.pop();
    Node* left = new Node(node->n, ++n, 'L');
    Node* right = new Node(node->n, ++n, 'R');
    nodes.emplace_back(left);
    nodes.emplace_back(right);
    que.push(left);
    que.push(right);
  }
  for (const auto& a : A) {
    string res = "";
    Node* cur = nodes[a];
    while (cur->n != 0) {
      res += cur->c;
      cur = nodes[cur->parent];
    }
    reverse(res.begin(), res.end());
    cout << res << '\n';
  }
  return 0;
}