#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> pi;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define mp make_pair
#define F first 
#define S second

int n;
const int m = 19683;
string s;
pi dp[m];

bool win(vector<int> a, int turn) {
    bool row[3] = {true, true, true}, col[3] = {true, true, true}, d1 = true, d2 = true;
    F0R(i, 3) F0R(j, 3) if (a[3*i+j] != turn) {
        row[i] = false; col[j] = false;
        if (i==j) d1 = false;
        if (i==2-j) d2 = false;
    }
    return row[0] || row[1] || row[2] || col[0] || col[1] || col[2] || d1 || d2;
}
vector<int> to_vec(int x) {
    vector<int> a(9);
    F0R(i, 9) {
        a[i] = x % 3;
        x /= 3;
    }
    return a;
}
int from_vec(vector<int> a) {
    int pow = 1, x = 0;
    F0R(i, 9) {
        x += pow * a[i];
        pow *= 3;
    }
    return x;
}

void dfs(int x, int turn) {
    if (dp[x] != mp(0,0)) return;
    vector<int> a = to_vec(x);
    if (win(a,0)) {
        dp[x] = mp(1,0);
        return;
    }
    if (win(a,1)) {
        dp[x] = mp(0,1);
        return;
    }
    F0R(i, 9) {
        if (a[i] == 2) {
            a[i] = turn;
            int nx = from_vec(a);
            dfs(nx, 1-turn);
            dp[x].F += dp[nx].F;
            dp[x].S += dp[nx].S;
            a[i] = 2;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    dfs(m-1, 0);
    cin >> n;
    F0R(test, n) {
        cin >> s;
        int x = 0, pow = 1;
        F0R(i, 9) {
            int a = 2;
            if (s[i]=='X') a = 0;
            if (s[i]=='O') a = 1;
            x += a*pow;
            pow *= 3;
        }
        if (dp[x] == mp(0,0)) cout << "-1 -1\n";
        else cout << dp[x].F << ' ' << dp[x].S << '\n';
    }
}