#include <iostream>

std::string S;
bool used[1000];
int L;

int count(char c){
    int res = 0;
    for(int i=0;i<L;i++){
        if(S[i] == c){res++;}
    }
    return res;
}

int find(char c, int ub){
    for(int i=0;i<ub;i++){
        if(S[i] == c && !used[i]){
            return i;
        }
    }
    return -1;
}

int max(char c){
    for(int i=L-1;i>=0;i--){
        if(S[i] == c){return i;}
    }
}

int main(){
    int T;
    std::cin >> T;
    
    while(T--){
        std::cin >> S;

        L = S.size();

        for(int i=0;i<L;i++){used[i] = false;}

        bool can = true;

        if(count('R') != count('G') ||
           L < count('R') * 3){
            can = false;
        }else{
            for(int i=0;i<L;i++){
                if(S[i] == 'R'){
                    int g_index = find('G', i);
                    if(g_index == -1){can = false; break;}
                    used[g_index] = true;
                    int w_index = find('W', g_index);
                    if(w_index == -1){can = false; break;}
                    used[w_index] = true;
                }
            }

            int g_mx = max('G');
            for(int i=g_mx+1;i<L;i++){
                if(S[i] == 'W'){can = false; break;}
            }
        }

        std::cout << (can ? "possible" : "impossible") << std::endl;
    }
}