#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define N_MAX 1000

char s[N_MAX + 1];
char t[N_MAX + 1];

int answer;

int i, j, n;

int abs(int x){
	return (x > 0) ? x : -x;
}

int min(int x, int y){
	return (x > y) ? y : x;
}

int comp (int *x, int *y) {
	return *y - *x;
}

int solve(){

	char *p;
	int w, g, r;
	w = g = r = 0;

	for (p = s; *p; p++) {
		switch (*p) {
		case 'W':
			w++;
			break;
		case 'G':
			g++;
			if (g > w) return 0;
			break;
		case 'R':
			r++;
			if (r > g) return 0;
			break;
		}
	}

	if (g == r && g) {
		return 2;
	} else {
		return 0;
	}

}

int main(void){

	const char imp[] = "impossible";

	scanf("%d", &n);

	for (j = 0; j < n; j++) {
		scanf("%s", s);
		puts(imp+solve());
	}

	return 0;
}