#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;


int cntW(string& s)
{
	set<char> winner;
	FOR (i, 0, 3)
	{
		if (s[3 * i] == s[3 * i + 1] && s[3 * i + 1] == s[3 * i + 2])
			winner.insert(s[3 * i]);
		if (s[i] == s[i + 3] && s[i + 3] == s[i + 6])
			winner.insert(s[i]);
	}
	if (s[0] == s[4] && s[4] == s[8])
		winner.insert(s[0]);
	if (s[2] == s[4] && s[4] == s[6])
		winner.insert(s[2]);
	winner.erase('.');
	return SZ(winner);
}

bool valid(string s)
{
	int cntx = 0, cnto = 0;
	FOR (i, 0, SZ(s))
	{
		if (s[i] == 'X')
			cntx++;
		if (s[i] == 'O')
			cnto++;
	}
	if (cntx > cnto + 1 || cnto > cntx)
		return false;
	if (cntW(s) == 2)
		return false;
	return true;
}

map<string, PII> dp;

PII f(string s, int cnt)
{
	if (dp.count(s))
		return dp[s];
	if (cntW(s))
	{
		int x = cnt & 1;
		dp[s] = {x, x ^ 1};
		return dp[s];
	}
	if (cnt == 9)
		return {0, 0};
	PII p = {0, 0};
	FOR (i, 0, SZ(s))
	{
		if (s[i] == '.')
		{
			s[i] = cnt & 1 ? 'O' : 'X';
			auto p2 = f(s, cnt + 1);
			p.F += p2.F;
			p.S += p2.S;
			s[i] = '.';
		}
	}
	dp[s] = p;
	return dp[s];
}

void solve()
{
	string s;
	cin >> s;
	if (!valid(s))
	{
		cout << "-1 -1\n";
		return;
	}
	int cnt = 0;
	FOR (i, 0, 9)
		cnt += s[i] != '.';
	auto p = f(s, cnt);
	cout << p.F << ' ' << p.S << '\n';
	
}

int main()
{	
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	return 0;
}