#include <bits/stdc++.h>
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define f first
#define s second
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int N = 2e5 + 5;

char s[3][3];
int cnt[2];
bool used[2][19683];
pair<int, int> dp[2][19683];

bool win(char c){
	for(int i = 0; i < 3; i++){
		if(s[i][0] == c && s[i][1] == c && s[i][2] == c) return 1;
		if(s[0][i] == c && s[1][i] == c && s[2][i] == c) return 1;
	}
	if(s[0][0] == c && s[1][1] == c && s[2][2] == c)
		return 1;
	if(s[0][2] == c && s[1][1] == c && s[2][0] == c)
		return 1;
	return 0;
}
pair<int, int> calc(bool type){
	int id = 0;
	for(int i = 0; i < 9; i++){
		if(s[i / 3][i % 3] == '.') id = id * 3;
		if(s[i / 3][i % 3] == 'X') id = id * 3 + 1;
		if(s[i / 3][i % 3] == 'O') id = id * 3 + 2;
	}
	
	if(win('X')){
		return {1, 0};
	}
	if(win('O')){
		return {0, 1};
	}
	if(used[type][id]){
		return dp[type][id];
	}
	used[type][id] = 1;
	
	pair<int, int> res = {0, 0};
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			if(s[i][j] == '.'){
				if(!type){
					s[i][j] = 'X';
					auto x = calc(type ^ 1);
					res.f += x.f;
					res.s += x.s;
				}else{
					s[i][j] = 'O';
					auto x = calc(type ^ 1);
					res.f += x.f;
					res.s += x.s;
				}
				s[i][j] = '.';
			}
		}
	}
	
	return dp[type][id] = {res.f, res.s};
}
void solve(){
	int cntx = 0, cnty = 0;
	for(int i = 0; i < 9; i++){
		char c;
		cin >> c;
		s[i / 3][i % 3] = c;
		if(c == 'X') cntx++;
		if(c == 'O') cnty++;
	}
	if(cnty > cntx || abs(cntx - cnty) > 1){
		cout << "-1 -1\n";
		return;
	}
	if(win('X') && win('O')){
		cout << "-1 -1\n";
		return;
	}
	if(win('X') && cntx != cnty + 1){
		cout << "-1 -1\n";
		return;
	}
	if(win('O') && cntx != cnty){
		cout << "-1 -1\n";
		return;
	}
	auto x = calc(cntx != cnty);
	cout << x.f << " " << x.s << "\n";
}

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