#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

map<vector<string>, pi> cnt;

bool win(vector<string> a, char c){
	for (int i = 0; i < 3; i ++){
		int cnt = 0;
		for (int j = 0; j < 3; j ++) cnt += a[i][j] == c;
		if (cnt == 3) return true;
	}
	for (int j = 0; j < 3; j ++){
		int cnt = 0;
		for (int i = 0; i < 3; i ++) cnt += a[i][j] == c;
		if (cnt == 3) return true;
	}
	if ((a[0][0] == c) + (a[1][1] == c) + (a[2][2] == c) == 3) return true;
	if ((a[2][0] == c) + (a[1][1] == c) + (a[0][2] == c) == 3) return true;
	return false;
}

pi dfs(vector<string> &a, int tag){
	if (cnt.count(a)) return cnt[a];
	if (win(a, 'O')) return cnt[a] = {0, 1};
	if (win(a, 'X')) return cnt[a] = {1, 0};
	pi ans = {0, 0};
	for (int i = 0; i < 3; i ++){
		for (int j = 0; j < 3; j ++){
			if (a[i][j] == '.'){
				if (tag == 1){
					a[i][j] = 'O';
					pi p = dfs(a, 0);
					ans.fi += p.fi; ans.se += p.se;					
					a[i][j] = '.';
				} else{
					a[i][j] = 'X';
					pi p = dfs(a, 1);
					ans.fi += p.fi; ans.se += p.se;
					a[i][j] = '.';
				}
			}
		}
	}
	return cnt[a] = ans;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	vector<string> a(3, "...");
	dfs(a, 0);
	int t; cin >> t;
	while(t --){
		string s; cin >> s;
		vector<string> cur(3);
		for (int i = 0; i < 3; i ++){
			cur[i] = s.substr(i * 3, 3);
		}
		if (cnt.count(cur)){
			cout << cnt[cur].fi << ' ' << cnt[cur].se << '\n';
		} else{
			cout << "-1 -1\n";
		}
	}
}

/*
Do something instead of nothing!
Print out stuffs / study samples when you cannot find the bug!
*/