#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
// mt19937 g(chrono::high_resolution_clock::now().time_since_epoch().count());

int p3[15];

const int K = 19683;
bool vis[K];
int dp[K][2];
vector<int> edg[K];


int gett(int x, int p) {
    return (x / p3[p]) % 3;
}

int sett(int x, int p, int y) {
    return ((x / p3[p + 1]) * 3 + y) * p3[p] + (x % p3[p]);
}

int done(int x) {
    int a[3][3];
    for(int i = 2; i >= 0; i--)
        for(int j = 2; j >= 0; j--) {
            a[i][j] = x % 3;
            x /= 3;
        }

    for(int i = 0; i < 3; i++) {
        for(int j = 1; j <= 2; j++) {
            if (a[i][0] == j && a[i][1] == j && a[i][2] == j) return j;
            if (a[0][i] == j && a[1][i] == j && a[2][i] == j) return j;
        }
    }

    for(int j = 1; j <= 2; j++) {
        if (a[0][0] == j && a[1][1] == j && a[2][2] == j) return j;
        if (a[0][2] == j && a[1][1] == j && a[2][0] == j) return j;
    }
    return 0;
}

void DFS(int x) {
    if(vis[x])  return;
    vis[x] = true;

    if(done(x)) {
        return;
    }

    int cnt = 0;
    for(int i = 0; i < 9; i++)
        if(gett(x, i) != 0)
            cnt++;

    cnt %= 2;
    cnt++;

    for(int i = 0; i < 9; i++)
        if(gett(x, i) == 0) {
            int y = sett(x, i, cnt);
            edg[x].push_back(y);
            DFS(y);
        }
}

void pre() {
    int N = 9;
    p3[0] = 1;
    for(int i = 1; i <= N; i++)  p3[i] = 3 * p3[i - 1];

    DFS(0);

    for(int i = K - 1; i >= 0; i--) {
        if(!vis[i]) continue;
        int win = done(i);
        if(win) {
            dp[i][win - 1] = 1;
            continue;
        }

        for(auto nxt: edg[i]) {
            dp[i][0] += dp[nxt][0];
            dp[i][1] += dp[nxt][1];
        }
    }

}

void solve_test() {
    map<char, int> mp;
    mp['.'] = 0;
    mp['X'] = 1;
    mp['O'] = 2;
    string s;
    cin >> s;
    int msk = 0;
    for(int i = 0; i < 9; i++) {
        int x = mp[ s[i] ];
        msk = msk * 3 + x;
    }

    if(!vis[msk]) {
        printf("-1 -1\n");
        return;
    }

    printf("%d %d\n", dp[msk][0], dp[msk][1]);
}

int main() {
#ifdef USEFOPEN
    freopen("1.in", "r", stdin);
    //freopen("1.out", "w", stdout);
#endif

    cin.sync_with_stdio(false); cin.tie(0);

    pre();

    int T = 1;
//    scanf("%d", &T);
    cin >> T;
    for(int t = 1; t <= T; t++) {
        //printf("Case #%d: ", t);
        solve_test();
    }

    return 0;
}