#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se sceond
int dp[262144];
vector<int>e[262144];
int res[262144];
int dp1[262144],dp2[262144];
bool vis[262144];
int c[9];
int win(int x,int y,int z){
	int mn=min(c[x],min(c[y],c[z]));
	int mx=max(c[x],max(c[y],c[z]));
	if(mn==mx) return mx;
	else return 0;
}
void dfs(int id){
	if(vis[id]) return;
	vis[id]=true;
	for(auto c:e[id]) dfs(c);
}
int main(){
	ios::sync_with_stdio(false);
	for(int i=(1<<18)-1; i>=0 ;i--){
		int cnt=0;
		for(int j=0; j<9 ;j++){
			c[j]=(i>>(2*j))&3;
			if(c[j]==3){
				res[i]=-1;
				break;
			}
			cnt+=(c[j]!=0);
		}
		int diu=win(0,1,2)+win(3,4,5)+win(6,7,8)+win(0,3,6)+win(1,4,7)+win(2,5,8)+win(0,4,8)+win(2,4,6);
		if(diu>0){//game ends
			if(diu==1) dp1[i]=1;
			else dp2[i]=1;
			continue;
		}
		//build edges
		int nc=1+(cnt%2==0);
		for(int j=0; j<9 ;j++){
			if(c[j]!=0) continue;
			int ni=i|(nc<<(2*j));
			dp1[i]+=dp1[ni];
			dp2[i]+=dp2[ni];
			e[i].push_back(ni);
		}
	}
	dfs(0);
	
	int t;cin >> t;
	while(t--){
		string s;cin >> s;
		int cur=0;
		for(int i=0; i<9 ;i++){
			if(s[i]=='X') cur|=(2<<(2*i));
			if(s[i]=='O') cur|=(1<<(2*i));
		}
		if(!vis[cur]) cout << "-1 -1\n";
		else cout << dp2[cur] << ' ' << dp1[cur] << '\n';
	}
}