#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>

#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(long (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(long (i)=(a)-1;(i)>=(b);(i)--)
#define MOD 1000000007
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define PII pair<int,int>
#define PLL pair<long,long>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define RSORT(a) sort((a).begin(),(a).end(),greater<int>())

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

bool func(string s){
    if(s[0]!='W') return false;
    int gcnt=0,rcnt=0,wcnt=0,bus=0;

    RREP(i,s.size()){
        if(s[i]=='R') {rcnt++;}
        if(s[i]=='G') {gcnt++;}
        if(s[i]=='W') {
            wcnt++; bus+=bus<gcnt?1:0;
        }
        if(wcnt&&!gcnt) return false;
        if(wcnt&&!rcnt) return false;
        if(gcnt>rcnt) return false;
    }
    return rcnt==gcnt && wcnt>=gcnt && bus==gcnt;
}

int main(void){
    int T; cin>>T;
    vector<string> S(T);
    REP(i,T) cin>>S[i];
    REP(i,T){
        if(func(S[i])) cout<<"possible"<<endl;
        else cout<<"impossible"<<endl;
    }
}