#include <bits/stdc++.h>

std::map<std::vector<int>, std::pair<int, int>> map;

std::pair<int, int> operator+(const std::pair<int, int> &lhs, const std::pair<int, int> &rhs) {
	return std::make_pair(lhs.first + rhs.first, lhs.second + rhs.second);
}	
const std::vector<std::vector<int>> tests = {
	{ 0, 1, 2 },
	{ 3, 4, 5 },
	{ 6, 7, 8 },
	{ 0, 3, 6 },
	{ 1, 4, 7 },
	{ 2, 5, 8 },
	{ 0, 4, 8 },
	{ 2, 4, 6 }
};
int check(const std::vector<int> &vec) {

	for (auto &test : tests) {
		if (vec[test[0]] != 0 && vec[test[0]] == vec[test[1]] && vec[test[0]] == vec[test[2]]) {
			return vec[test[0]];
		}
	}
	return 0;
}

std::pair<int, int> dfs(std::vector<int> cur, int o) {
	if (map.count(cur))
		return map[cur];
	int t = check(cur);
	if (t == 1)
		return map[cur] = std::make_pair(1, 0);
	if (t == 2)
		return map[cur] = std::make_pair(0, 1);
	std::pair<int, int> ans = std::make_pair(0, 0);
	for (int i = 0; i < 9; ++i) {
		if (cur[i] == 0) {
			cur[i] = 1 + o;
			ans = ans + dfs(cur, !o);
			cur[i] = 0;
		}
	}
	return map[cur] = ans;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
	dfs(std::vector<int>(9, 0), 0);
	int T;
	std::cin >> T;
	while (T--) {
		std::string s;
		std::cin >> s;
		std::vector<int> vec(9);
		for (int i = 0; i < 9; ++i) {
			if (s[i] == '.')
				vec[i] = 0;
			else if (s[i] == 'X')
				vec[i] = 1;
			else
				vec[i] = 2;
		}
		if (!map.count(vec)) {
			std::cout << "-1 -1\n";
		}
		else {
			auto p = map[vec];
			std::cout << p.first << " " << p.second << "\n";
		}
	}
}