#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

void possible()
{
	cout << "possible" << endl;
}

void impossible()
{
	cout << "impossible" << endl;
}

void resolve(const string& s)
{
	vector<string::size_type> index_list(s.length());
	string::size_type indexR = string::npos;
	string::size_type indexG = string::npos;
	string::size_type indexW = string::npos;
	int countR = 0;
	int countG = 0;
	int countW = 0;
	for (string::size_type i = 0; i < s.length(); i++) {
		char ch = s[i];
		switch (ch) {
		case 'R':
			countR++;
			index_list[i] = indexR;
			indexR = i;
			break;
		case 'G':
			countG++;
			index_list[i] = indexG;
			indexG = i;
			break;
		case 'W':
			countW++;
			index_list[i] = indexW;
			indexW = i;
			break;
		}
	}
	if (countR != countG || countG > countW) {
		impossible();
		return;
	}
	for (int i = 0; i < countR; i++) {
		if (countG > countW) {
			impossible();
			return;
		}
		if (indexR < indexG || indexG < indexW) {
			impossible();
			return;
		}
		indexR = index_list[indexR];
		countR--;
		indexG = index_list[indexG];
		countG--;
		do {
			indexW = index_list[indexW];
			countW--;
		} while (indexW > indexG);
	}
	possible();
}

int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		resolve(s);
	}
	return 0;
}