#include <bits/stdc++.h>

using namespace std;
const int N = 1e4;
int cnt[N][2], maxind;
map<string, int> ind;
int check(string &s) {
    int cntX = 0, cntO = 0;
    for (char c: s) {
        if (c == 'X') {
            cntX++;
        } else if (c == 'O') {
            cntO++;
        }
    }
    if (cntO > cntX || cntX - cntO > 1) {
        return 0;
    }
    cntO = cntX = 0;
    for (int i = 0; i < 3; i++) {
        int cO = 0, cX = 0;
        for (int j = 0; j < 3; j++) {
            cO += s[i * 3 + j] == 'O';
            cX += s[i * 3 + j] == 'X';
        }
        cntO += cO == 3;
        cntX += cX == 3;
        cO = 0, cX = 0;
        for (int j = 0; j < 3; j++) {
            cO += s[j * 3 + i] == 'O';
            cX += s[j * 3 + i] == 'X';
        }
        cntO += cO == 3;
        cntX += cX == 3;
    }
    int cO = 0, cX = 0;
    for (int i = 0; i < 3; i++) {
        cO += s[i * 4] == 'O';
        cX += s[i * 4] == 'X';
    }
    cntO += cO == 3;
    cntX += cX == 3;
    cO = 0, cX = 0;
    for (int i = 0; i < 3; i++) {
        cO += s[i * 3 + 2 - i] == 'O';
        cX += s[i * 3 + 2 - i] == 'X';
    }
    cntO += cO == 3;
    cntX += cX == 3;
    if (cntO > 0 && cntX > 0) {
        return 0;
    }
    if (cntO) {
        return 2;
    } else if (cntX) {
        return 1;
    }
    return 3;
}
// 0 = invalid
// 1 = X wins
// 2 = O wins
// 3 = .
int build(string s, int turn = 0) {
    int st = check(s);
    if (st == 0) {
        return -1;
    }
    if (ind.find(s) != end(ind)) {
        return ind[s];
    }
    int t = ++maxind;
    ind[s] = t;
    if (st == 1) {
        cnt[t][0] = 1;
    } else if (st == 2) {
        cnt[t][1] = 1;
    } else {
        for (int i = 0; i < 9; i++) {
            if (s[i] == '.') {
                if (turn) {
                    s[i] = 'O';
                } else {
                    s[i] = 'X';
                }
                int a = build(s, !turn);
                if (a != -1) {
                    cnt[t][0] += cnt[a][0];
                    cnt[t][1] += cnt[a][1];
                }
                s[i] = '.';
            }
        }
    }
    return t;
}
void solve() {
    string s;
    cin >> s;
    if (ind.find(s) == end(ind)) {
        cout << "-1 -1";
        return;
    }
    int t = ind[s];
    cout << cnt[t][0] << ' ' << cnt[t][1];
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    string s = ".........";
    build(s);
    int test;
    cin >> test;
    while (test--) {
        solve();
        cout << '\n';
    }
    return 0;
}