#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); string s; bool solve() { int l = s.size(); int g = 0; int t = 0; for (int i = l-1; i >= 0; i--) { switch(s[i]) { case 'R': t++; break; case 'G': if (t == 0) return false; g++; t--; break; case 'W': if (g == 0) return false; break; } } return t == 0; } void input() { cin >> s; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); int t; cin >> t; for (int i = 0; i < t; i++) { input(); cout << (solve()?"possible":"impossible") << endl; } }