#include <bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint>PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;
int dx[]={0,0,1,-1};
int dy[]={-1,1,0,0};

int N,cnt,cnt1;
string s;
bool can;

signed main(){
    cin.tie(0);
	ios::sync_with_stdio(false);
    cin>>N;
    rep(i,0,N){
        cin>>s;
        //cout<<s<<endl;
        cnt=0;
        cnt1=0;
        can=true;
        rep(i,0,s.size()){
            if(s[i]=='W')cnt1++;
            else if(s[i]=='G'){
                cnt++;
                cnt1--;
            }
            else if(s[i]=='R')cnt--;
            if(cnt<0)can=false;
            if(cnt1<0)can=false;
        }
        rrep(i,0,s.size()){
            if(s[i]=='G')break;
            else if(s[i]=='W')can=false;
        }
        if(cnt!=0 || can==false)cout<<"impossible"<<endl;
        else cout<<"possible"<<endl;
    }
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
}