Problem Statement

Kyoto's city buses run on several routes.
For each route, the last bus of the day and the bus $1$ before the last bus have display board lights of a different color than usual.
The usual light color is white, but the light of the bus 1 before the last bus is green, and the light of the last bus is red.
From the first bus to the last bus of the day, yuki checked the light colors of all buses passing along a certain road, and wrote them down in a memo in the order in which they were seen.
yuki is worried that the memo may contain mistakes.
Write a program that checks whether the order of light colors shown in this memo is a possible pattern.
Here, assume that city buses of every route run at least $3$ times every day, and follow the same path throughout $1$ day.

Figure 1. A Kyoto city bus on Route 3, with the usual light. Incidentally, the characters become slightly harder to read with green or red lights (at Hyakumanben, February 4, 2015)

Input

The $1$st line of the input contains an integer $T$, the number of test cases.
Each test case consists of $1$ line, containing a string $S$.
The $i$-th character of the string $S$ indicates the light color of the $i$-th bus seen in yuki's memo for that day, where $\verb|W|$ means white, $\verb|G|$ means green, and $\verb|R|$ means red. No other characters are included.

• $1 \leq T \leq 1000$
• $1 \leq |S| \leq 1000$

Output

For each test case, output $\verb|possible|$ if it is a possible pattern, and $\verb|impossible|$ otherwise.

Sample

5
WWWWWWWWWGR
WWWWGWGRR
WWWWWWWWWWWWWWGRRG
WGRWGR
WWWWWWWWWWWWWWWWWGGWGWGGWGWGGGWGG

possible
possible
impossible
possible
impossible