#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define PB push_back
#define MP make_pair
#define A first
#define B second
#define SZ(x) int(x.size())
#define FR(i, a, b) for (int i = (a); i < (b); ++i)
#define FOR(i, n) FR(i, 0, n)
const int M = 1000000007;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

int n;

int State(vector<vector<int>>& s) {
    int win = 0;
    FOR(i, 3) {
        if (s[i][0] == s[i][1] && s[i][0] == s[i][2]) {
            if (s[i][0] == 1) win |= 1;
            if (s[i][0] == 2) win |= 2;
        }
        if (s[0][i] == s[1][i] && s[0][i] == s[2][i]) {
            if (s[0][i] == 1) win |= 1;
            if (s[0][i] == 2) win |= 2;
        }
    }
    if (s[0][0] == s[1][1] && s[0][0] == s[2][2]) {
        if (s[0][0] == 1) win |= 1;
        if (s[0][0] == 2) win |= 2;
    }
    if (s[2][0] == s[1][1] && s[2][0] == s[0][2]) {
        if (s[1][1] == 1) win |= 1;
        if (s[1][1] == 2) win |= 2;
    }
    return win;
}

int to(vector<vector<int>>& state) {
    int tot = 0;
    FOR(i, 3) {
        FOR(j, 3) {
            tot *= 3;
            tot += state[i][j];
        }
    }
    return tot;
}

unordered_map<int, pair<int, int>> mp;

pair<int, int> dfs(vector<vector<int>>& state, int cnt) {
    int T = to(state);
    if (mp.count(T)) return mp[T];
    int win = 0;
    if (cnt >= 5) win = State(state);
    if (win == 3) {
        return mp[T] = MP(0, 0);
    }
    if (win == 1) {
        return mp[T] = MP(1, 0);
    }
    if (win == 2) {
        return mp[T] = MP(0, 1);
    }
    if (cnt == 9) return mp[T] = MP(0, 0);
    int c = ((cnt & 1)?2:1);
    pair<int, int> ans{};
    FOR(i, 3) {
        FOR(j, 3) {
            if (state[i][j] == 0) {
                vector<vector<int>> nxt = state;
                nxt[i][j] = c;
                auto p = dfs(nxt, cnt + 1);
                ans.A += p.A;
                ans.B += p.B;
            }
        }
    }
    return mp[T] = ans;
}

// X for 1, O for 2; . for 0
void solve() {
    vector<vector<int>> state(3, vector<int>(3));
    string s;
    cin >> s;

    FOR(i, 3) {
        FOR(j, 3) {
            if (s[i * 3 + j] == 'X') state[i][j] = 1;
            if (s[i * 3 + j] == 'O') state[i][j] = 2;
        }
    }
    int Xcnt = 0, Ocnt = 0;
    FOR(i, 3) {
        FOR(j, 3) {
            if (state[i][j] == 1) Xcnt++;
            if (state[i][j] == 2) Ocnt++;
        }
    }
  
    if (Xcnt < Ocnt || Xcnt > Ocnt + 1) {
        cout << "-1 -1\n";
        return;
    }
    if (State(state) == 3) {
        cout << "-1 -1\n";
        return;
    }

    auto p = dfs(state, Xcnt + Ocnt);
    cout << p.A << ' ' << p.B << '\n';
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int numtests;
    cin >> numtests;
    while(numtests--) {
        solve();
    }
}