// ﾅﾆｿﾚｲﾐﾜｶﾝﾅｲ

#include <iostream>
#include <cstring>

std::string S;
int L;

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

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

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

        L = S.size();

        bool can = true;

        if(count('R') != count('G') ||
           L < count('R') * 3){
            can = false;
        }else{
            int w = 0, g = 0, r = 0;
            while(r < L && S[r] != 'R'){r++;}
            
            for(;r<L;){
                while(w < L && S[w] != 'W'){w++;}
                while(g < L && S[g] != 'G'){g++;}

                if(w == L || g == L || w > g || g > r){can = false; break;}
                r++;
                while(r < L && S[r] != 'R'){r++;}
                w++; g++;
            }

            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;
    }
}