//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int T,vi[20009],v1[20009],v2[20009];
char s[12];
inline int ff(void) {
	int uu=0;
	for(int i=1;i<=9;i++) uu=uu*3+(s[i]=='O'?0:(s[i]=='X'?1:2));
	return uu;
}
inline bool over(void) {
	if(s[1]!='.'&&s[1]==s[2]&&s[2]==s[3]) return 1;
	if(s[4]!='.'&&s[4]==s[5]&&s[5]==s[6]) return 1;
	if(s[7]!='.'&&s[7]==s[8]&&s[8]==s[9]) return 1;
	if(s[1]!='.'&&s[1]==s[4]&&s[4]==s[7]) return 1;
	if(s[2]!='.'&&s[2]==s[5]&&s[5]==s[8]) return 1;
	if(s[3]!='.'&&s[3]==s[6]&&s[6]==s[9]) return 1;
	if(s[1]!='.'&&s[1]==s[5]&&s[5]==s[9]) return 1;
	if(s[3]!='.'&&s[3]==s[5]&&s[5]==s[7]) return 1;
	return 0;
}
void dfs(int n,bool fl) {
	if(vi[n]) return;
	vi[n]=1;
	if(over()) {
		if(fl) v1[n]=1,v2[n]=0;
		else v1[n]=0,v2[n]=1;
		return ;
	}
	for(int i=1;i<=9;i++) {
		if(s[i]!='.') continue;
		if(fl) s[i]='X';else s[i]='O';
		dfs(ff(),fl^1);
		v1[n]+=v1[ff()];
		v2[n]+=v2[ff()];
		s[i]='.';
	}
	return;
}
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
	scanf("%d",&T);
	for(int i=1;i<=9;i++) s[i]='.';
	dfs(19682,1); 
	while(T--) {
		scanf("%s",s+1);
		int uu=ff();
		if(vi[uu]) printf("%d %d\n",v1[uu],v2[uu]);
		else printf("-1 -1\n");
	}
    return 0;
}