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

map<vector<int>, pair<int, int>> m;

void solve() {
    string s; cin >> s;
    vector<int> tmp(9);
    for (int i= 0; i < 9; ++i) {
        if (s[i] == 'X') tmp[i] = 1;
        if (s[i] == 'O') tmp[i] = 2;
    }
    if (m.find(tmp) == m.end()) {
        cout << "-1 -1\n";
    } else {
        cout << m[tmp].first << " " << m[tmp].second << "\n";
    }
}

int main() {
    cin.tie(0);
    cin.sync_with_stdio(0);

    auto win = [] (vector<int>& board, int chk) {
        for (int i= 0; i < 3; ++i) 
            if (board[i*3] == board[i*3+1] && board[i*3+1] == board[i*3+2] && board[i*3+2] == chk) return true;
        for (int i = 0; i < 3; ++i) {
            if (board[i] == board[i+3] && board[i+3] == board[i+6] && board[i+6] == chk) return true;
        }
        if (board[0] == board[4] && board[4] == board[8] && board[8] == chk) return true;
        if (board[2] == board[4] && board[4] == board[6] && board[6] == chk) return true;
        return false;
    };

    auto pre = [&] (auto&& slf, vector<int>& board, int play) -> pair<int, int> {
        if (m.find(board) != m.end()) return m[board];
        if (win(board, 1)) return m[board] = {1, 0};
        if (win(board, 2)) return m[board] = {0, 1};

        pair<int, int> ret = {0, 0};
        for (int i = 0; i < 9; ++i) {
            if (board[i]) continue;
            board[i] = play;
            auto tmp = slf(slf, board, 3-play);
            ret.first += tmp.first;
            ret.second += tmp.second;
            board[i] = 0;
        }  
        return m[board] = ret;
    };

    vector<int> start(9);
    pre(pre, start, 1);

	int t = 1;
    cin >> t;
	while (t--) solve();
}