#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int, int>

#define MOD 1000000007
#define INF 2147483647
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int main() {
    int t;
    int w, g, r;
    cin >> t;
    for (int i = 0; i < t; i++)
    {
        string s;
        cin >> s;
        w = g = r = 0;
        bool miss = false;
        for (int j = 0; j < s.length(); j++)
        {
            switch (s[j]) {
                case 'W':
                    w++;
                    break;
                case 'G':
                    if (w <= g) {
                        miss = true;
                    }
                    else {
                        g++;
                    }
                    break;
                case 'R':
                    if (g <= r) {
                        miss = true;
                    }
                    else {
                        r++;
                    }
                    break;
            }
            if (miss) break;
        }
        if (miss || g != r || g == 0) cout << "impossible" << endl;
        else cout << "possible" << endl;
    }
    getchar(); getchar();
    return 0;
}