#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int S = 1 << (2 * 9);
pair<int, int> res[S];

int enc(const string& str) {
	int s = 0;
	for (int i = 0; i < str.size(); ++i) {
		if (str[i] == 'X') s |= 1 << (2 * i);
		if (str[i] == 'O') s |= 2 << (2 * i);
		if (str[i] == '.') s |= 3 << (2 * i);
	}
	return s;
}
string dec(int s) {
	string res(9, 'f');
	for (int i = 0; i < 9; ++i) {
		int t = (s >> (2 * i)) % 4;
		if (t == 1) res[i] = 'X';
		else if (t == 2) res[i] = 'O';
		else if (t == 3) res[i] = '.';
	}
	return res;
}
void recDP(int s) {
	if (res[s].first != -1) return;
	string str = dec(s);
	res[s].second = 0;
	res[s].first = 0;

	int win = 0;
	for (int y = 0; y < 3; ++y) {
		int xs = 0, os = 0;
		for (int x = 0; x < 3; ++x) {
			if (str[3*y + x] == 'X') ++xs;
			else if (str[3*y + x] == 'O') ++os;
		}
		if (xs == 3) win = 1;
		else if (os == 3) win = -1;
	}
	for (int x = 0; x < 3; ++x) {
		int xs = 0, os = 0;
		for (int y = 0; y < 3; ++y) {
			if (str[3*y + x] == 'X') ++xs;
			else if (str[3*y + x] == 'O') ++os;
		}
		if (xs == 3) win = 1;
		else if (os == 3) win = -1;
	}
	for (int d = 0; d < 2; ++d) {
		int xs = 0, os = 0;
		for (int x = 0; x < 3; ++x) {
			int y = (d == 0 ? x : 2 - x);
			if (str[3*y + x] == 'X') ++xs;
			else if (str[3*y + x] == 'O') ++os;
		}
		if (xs == 3) win = 1;
		else if (os == 3) win = -1;
	}
	if (win != 0) {
		if (win == 1) res[s].first = 1;
		else res[s].second = 1;
		return;
	}

	int t = 0;
	for (auto c : str) t ^= (c != '.');
	for (int y = 0; y < 3; ++y) {
		for (int x = 0; x < 3; ++x) {
			int ind = 3*y + x;
			if (str[ind] != '.') continue;
			
			str[ind] = "XO"[t];
			int t_ind = enc(str);
			str[ind] = '.';
		
			recDP(t_ind);
			res[s].first += res[t_ind].first;
			res[s].second += res[t_ind].second;
		}
	}
}

void solve() {
	string str;
	cin >> str;
	int s = enc(str);
	cout << res[s].first << ' ' << res[s].second << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	for (int s = 0; s < S; ++s) res[s] = {-1, -1};
	recDP(S - 1);

	int t;
	cin >> t;
	for (int ti = 0; ti < t; ++ti) solve();
}