Problem G
Can't Stop Playing

Some computer games are extremely fun and this problem may be about one of these.

You are given a sequence of one-dimensional blocks, each of length that is a power of two. The goal of the game is to merge all the blocks into one big block. The blocks are presented one by one, and for each one you have to decide whether to stick it immediately to the left or immediately to the right of the previous blocks.

Every time two blocks of the same size are adjacent, they merge into one block that is twice as long as each of them. Note that, as long as possible, the resulting blocks immediately merge with adjacent ones. For example, if the current sequence of blocks is $2, 4, 16$, then sticking $2$ on the left side leads to $8, 16$, while sticking it on the right side gives $2, 4, 16, 2$. Note that at any moment there is at most one mergeable pair of blocks.

You have lost the game (again!) and you are wondering whether there was any way to win at all. Analyze the sequence to find out.

Input

The first line of input contains the number of test cases $T$ ($1 \leq T \leq 115$). The descriptions of the test cases follow:

Each test case consists of two lines. The first one contains a positive integer $n \leq 1\, 000$ – the length of the sequence. The next line contains a sequence of $n$ block lengths, each a power of two. The sum of all the lengths does not exceed $2^{13}$.

The total number of integers in all test cases is at most $33\, 000$.

Output

For each test case, output one line containing the word no if winning the game is not possible. Otherwise, output a word consisting of $n$ letters l and r, denoting whether the corresponding block should be stuck to the left or to the right. Note that for the first block it does not matter.

3
9
2 8 4 1 1 4 4 4 4
5
2 16 4 8 2
3
2 2 2

rrrlllrrr
no
no