Apple Sharing

Terra and Lulu run an orchard. One day, they find $N$ harvested apples, each marked with one of L, M, and R.

Lulu suggests dividing the apples by playing a game. The $N$ apples are placed in a row on a table. Let $S$ be the length-$N$ string obtained by reading the marks from left to right.

Starting with Lulu, the two players alternate turns. On each turn, the player chooses one apple currently on the table.

• If the chosen apple is marked L, the player takes that apple and every apple to its left.
• If the chosen apple is marked R, the player takes that apple and every apple to its right.
• If the chosen apple is marked M, the player chooses one of the two actions above and performs it.

After apples are taken, the relative order of the remaining apples does not change. A player loses if there are no apples on the table when their turn begins.

Determine the winner when both Terra and Lulu play optimally.

The input is given from Standard Input in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$ $\vdots$ $\mathrm{case}_T$

Each case is given in the following format:

$N$ $S$

For each test case, print Terra if Terra wins, and print Lulu if Lulu wins.

• $1 \le T \le 200\,000$.
• $1 \le N \le 1\,000\,000$.
• $|S|=N$.
• $S_i$ is one of L, M, and R. ($1 \le i \le N$)
• The sum of $N$ over all test cases does not exceed $1\,000\,000$.