#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))

#define MOD 1000000007

int main(){
    int n;
    cin>>n;
    rep(i,0,n){
        string s;
        cin>>s;
        string s1;
        rep(j,0,s.sz){
            if(s[j]!='W'){
                s1+=s[j];
            }
        }
        int c = 0;
        int index1 = 0;
        int index2 = 0;
        for(;;){
          if(index1==s1.sz||index2==s1.sz){
            cout << "impossible" << endl;
            break;
          }
          if(index1>index2){
            cout << "impossible" << endl;
            break;
          }
          if(s1[index1]=='G'&&s1[index2]=='R'){
            c++;
            if(c*2==s1.sz){
                cout << "possible" << endl;
                break;
            }
            index1++;
            index2++;
          }
          else if(s1[index2]!='R'){
            index2++;
          }
          else{
            index1++;
          }
        }
    }
	return 0;
}