#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=101000;
map<string,PII> dp;
int n;
string s;

PII dfs(string s,int op) {
	if (dp.count(s)) return dp[s];
	// checkwin
	bool iswin=0;
	char px="XO"[op];
	rep(i,0,3) if (s[i*3]!='.'&&s[i*3]==s[i*3+1]&&s[i*3]==s[i*3+2]) iswin=1;
	rep(i,0,3) if (s[i]!='.'&&s[i]==s[i+3]&&s[i]==s[i+6]) iswin=1;
	if (s[0]!='.'&&s[0]==s[4]&&s[4]==s[8]) iswin=1;
	if (s[2]!='.'&&s[2]==s[4]&&s[4]==s[6]) iswin=1;
	if (iswin) {
		return dp[s]=op?mp(1,0):mp(0,1);
	}
	int f1=0,f2=0;
	rep(i,0,9) if (s[i]=='.') {
		string t=s;
		t[i]=px;
		auto ans=dfs(t,op^1);
		f1+=ans.fi;
		f2+=ans.se;
	}
	//cout<<s<<" "<<f1<<" "<<f2<<endl;
	return dp[s]=mp(f1,f2);
}

int main() {
	dfs(string(9,'.'),0);
	cin>>n;
	rep(i,0,n) {
		cin>>s;
		if (!dp.count(s)) puts("-1 -1");
		else {
			auto ans=dp[s];
			printf("%d %d\n",ans.fi,ans.se);
		}
	}
}