#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
    
    int T;
	string S;
	cin>>T;
	int lenR,lenG,lenW;
	bool www=false;
	bool asd=false;
	string ans[1000];
	rep(i,T){
		ans[i]="";
		cin>>S;
		while(S.size() != 0){
			www=false;
			asd=false;
			lenR = S.size()-1;
			if(S[lenR]!='R'){
				ans[i] = "im";
				break;
			}
			S.replace(lenR,1,"");
			
			for(lenG=lenR-1;lenG>=0;--lenG){
				if(S[lenG]=='G'){
					S.replace(lenG,1,"");
					break;
				}
			}
			if(lenG < 0){
				ans[i] = "im";
				break;
			}
			for(lenW=lenG-1;lenW>=0;--lenW){
				if(S[lenW]=='W'){
					if(www==true && asd==true){
						break;
					}
					S.replace(lenW,1,"");
					www=true;
				}
				else if(S[lenW]=='G'){
					asd=true;
				}
			}
			if(www!=true){
				ans[i] = "im";
				break;
			}else{
				www=false;
			}
		}
		ans[i] += "possible";
	}
	rep(i,T){
		P(ans[i]);
	}
    
    return 0;
}