Problem Statement

You are given a permutation $P = (P_0, P_1, \cdots, P_{N - 1})$ of $(0, 1, 2, \cdots, N - 1)$.
Your goal is to make $P = (0, 1, 2, \cdots, N - 1)$. To do so, you may perform the following $2$ operations in any order, up to $20000$ times.

• Swap $P_0$ and $P_1$.
• For $i = 0, 1, \cdots, N - 1$, simultaneously replace $P_i$ with $P_{(i + 1) \ \mathrm{mod} \ N}$.

Input

$N$
$P_0 \ P_1 \ \cdots P_{N - 1}$

• $3 \leq N \leq 100$
• $P$ is a permutation of $(0, 1, 2, \cdots, N - 1)$
• All inputs are integers

Output

If the goal can be achieved with $M$ operations, output a string of $M$ characters. The $i$-th character should be S if the $i$-th operation swaps $P_0$ and $P_1$, and R otherwise.
If there are multiple valid sequences of operations, you may output any of them.

Sample

4
3 1 0 2

SSRS

3
0 1 2

3
2 1 0

SRR