34919번 - Marbles 스페셜 저지다국어

문제

Busy Beaver lines up $N$ marbles numbered 1ドル$ through $N,ドル where the $i$-th marble shows a number $p_i \neq i,ドル and every number from 1ドル$ to $N$ appears exactly once among $p_1, \dots, p_N$ (more formally, $p$ is a permutation over 1,ドル \dots, N$ such that $p_i \neq i$).

He wants to paint the marbles so that each marble $i$ has a different color from marble $p_i$. However, he only has three colors: red, green, and blue. Help him find any valid painting.

입력

The first line contains a single integer $T$ (1ドル \leq T \leq 10^4$) --- the number of test cases.

The first line of each test case contains one integer $N$ (2ドル \le N \le 10^5$) --- the number of marbles.

The second line of each test case contains $N$ integers $p_1, p_2, \dots, p_N$ (1ドル \le p_i \le N$; $p_i \ne i$) --- the numbers on the marbles. These numbers form a rearrangement of the numbers 1,ドル \dots, N$ in some order.

The sum of $N$ over all test cases does not exceed 10ドル^5$.

출력

For each test case, output a string of length $N$ containing the characters R, G, and B, where the $i$-th character denotes the color (red, green, or blue, respectively) of the $i$-th marble, satisfying the constraints.

If there are multiple possible answers, you can output any of them. We have a proof that under these constraints, an answer always exists.

제한

노트

In the first test case, the coloring GBBGR works as follows:

• Marble 1ドル$ is colored green and has the number 2ドル$ written on it; marble 2ドル$ is colored blue, and since green is not blue, the constraint is satisfied.
• Marble 2ドル$ is colored blue and has the number 1ドル$ written on it; marble 1ドル$ is colored green, and since blue is not green, the constraint is satisfied.
• Marble 3ドル$ is colored blue and has the number 5ドル$ written on it; marble 5ドル$ is colored red, and since blue is not red, the constraint is satisfied.
• Marble 4ドル$ is colored green and has the number 3ドル$ written on it; marble 3ドル$ is colored blue, and since green is not blue, the constraint is satisfied.
• Marble 5ドル$ is colored red and has the number 4ドル$ written on it; marble 4ドル$ is colored green, and since red is not green, the constraint is satisfied.