from collections import deque

def bfs(start):
    queue = deque([])
    queue.append(start)
    route = [-1] * 4095
    route[0] = ''
    
    while len(queue) > 0:
        current_node = queue.popleft()
        if 2047 <= current_node <= 4094:
            continue
        route[2*current_node+1] = route[current_node] + 'L'
        route[2*current_node+2] = route[current_node] + 'R'
        queue.append(2*current_node+1)
        queue.append(2*current_node+2)
    
    return route

route = bfs(0)
m = int(input())

for _ in range(m):
    A_i = int(input())
    print(route[A_i])