#include <bits/stdc++.h>

using namespace std;
#define endl '\n'

int  dp1[200000] = {};
int  dp2[200000] = {};

int check(int pos) {
    int g[3][3] = {};
    for(int i = 0; i < 9; i++) {
        int v = pos % 3;
        pos /= 3;
        g[i/3][i % 3] = v;
    }
    for(int i = 0; i < 3; i++) {
        if(g[i][0] != 0 && g[i][1] == g[i][0] && g[i][1] == g[i][2]) return g[i][0];
        if(g[0][i] != 0 && g[0][i] == g[1][i] && g[1][i] == g[2][i]) return g[0][i];
    }

    if(g[0][0] != 0 && g[0][0] == g[1][1] && g[1][1] == g[2][2]) return g[0][0];
    if(g[2][0] != 0 && g[2][0] == g[1][1] && g[1][1] == g[0][2]) return g[2][0];
    return 0;
}

pair<int, int> recurse(int pos, int t) {
    if(dp1[pos] != -1) {
        return {dp1[pos], dp2[pos]};
    }
    int c = check(pos);
 //   cout << pos << " " << c << " " << t << endl;
    if(c != 0) {
        if(c == 1) {
            dp1[pos] = 1; dp2[pos] = 0;
            return {1,0};
        } else {
            dp1[pos] = 0; dp2[pos] = 1;
            return {0,1};
        }
    }
    int a1 = 0;
    int a2 = 0;
    int pw3 = 1;
    int tpos = pos;
    for(int i = 0; i < 9; i++) {
        int c = pos % 3;
        if(c == 0) {
            pair<int, int> ans = recurse(tpos +t*pw3, 3 - t);
            a1 += ans.first;
            a2 += ans.second;
        }
        pos /= 3;
        pw3 *= 3;
    }
    dp1[tpos] = a1;
    dp2[tpos] = a2;
    return {a1, a2};
    
    
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    for(int i = 0; i < 20000; i++) {
        dp1[i] = -1;
        dp2[i] = -1;
    }
    recurse(0,1);
    int n; cin >> n;
    for(int i = 0; i < n; i++) {
        int v = 0;
        string s; cin >> s;
        int p3 = 1;
        for(int j = 0; j < 9; j++) {
            if(s[j] == 'X') v += p3;
            if(s[j] == 'O') v += 2 * p3;
            p3 *= 3;
        }
        cout << dp1[v] << " " << dp2[v] << endl;
    }

    return 0;
}