#include<bits/stdc++.h>
#define add(x)g[x].push_back(id),d[id]++
#define F(i,j,k)for(int i=j;i<=k;i++)
using namespace std;
const int N=532500;
int a[90][90],b[90][90],f[N],h[N],d[N],v[N],T;
vector<int>g[N];
int c(int x,int y,int z){
	if(y%8==x%8&&x%8==z%8)x/=8,y/=8,z/=8;
	else{
		if(x/8!=y/8||y/8!=z/8)return 0;
		x%=8,y%=8,z%=8;
	}return min(y,z)<x&&x<max(y,z);
}
int main(){
	F(i,0,63){
		int x=i/8,y=i%8;
		F(dx,max(0,x-1),min(7,x+1))F(dy,max(0,y-1),min(7,y+1))a[i][dx*8+dy]=1;
		F(dy,0,7)b[i][x*8+dy]=1;
		F(dx,0,7)b[i][dx*8+y]=1;a[i][i]=b[i][i]=0;
	}
	F(i,0,63)F(j,0,63)F(k,0,63)F(l,0,1){
		int id=j<<13|l<<12|i<<6|k;
		if(!l){
			F(t,0,63)if(a[i][t]&&!a[k][t]&&t^j)add(id^((t^i)<<6)^4096);
			F(t,0,63)if(b[j][t]&&!c(i,j,t)&&t^i)add(id^((t^j)<<13)^4096);
		}else F(t,0,63)if(a[k][t]&&!a[i][t]&&(!b[j][t]||c(i,j,t)))add(id^4096^t^k^(j==t)*(j^64)<<13);
	}
	queue<int>q;
	F(i,0,N-1)if(!d[i]&&(b[i>>13][i&63]||a[i>>6&63][i&63]))q.push(i),v[i]=1;
	while(q.size()){
		int t=q.front();q.pop();
		for(int i:g[t])if(!f[t])
			!v[i]?h[i]=h[t]+1,q.push(i),f[i]=v[i]=1:h[i]=min(h[i],h[t]+1);
		else if(!v[i]){h[i]=max(h[i],h[t]+1);if(!--d[i])q.push(i),v[i]=1;}
	}
	cin>>T;
	while(T--){
		int id=0;char c;
		F(i,0,63)cin>>c,id|=c=='R'?i<<13:c=='W'?i<<6:(c=='B')*i;
		cout<<(h[id]+1)/2<<'\n';
	}
}