#include <bits/stdc++.h>
using namespace std;

const int MN = 9, MD = 1<<MN*2;

int T, dp[MD][2];

inline int bitAt(int b, int i) { return (b>>i*2)&3; }
inline bool invalid(int b) {
    int nx = 0, no = 0;
    for (int i = 0; i < 9; i++) {
        if (bitAt(b, i) == 3) return 1;
        nx += bitAt(b, i) == 1;
        no += bitAt(b, i) == 2;
    }
    return !(nx == no || nx == no+1);
}
inline int isWin(int b) {
    int ans = 0;
    for (int z: {1,2}) {
        bool b3 = 1, b4 = 1;
        for (int i = 0; i < 3; i++) {
            bool b1 = 1, b2 = 1;
            for (int j = 0; j < 3; j++) {
                b1 &= bitAt(b, i*3+j) == z;
                b2 &= bitAt(b, j*3+i) == z;
            }
            if (b1 || b2) ans |= z;
            b3 &= bitAt(b, i*3+i) == z;
            b4 &= bitAt(b, i*3+2-i) == z;
        }
        if (b3 || b4) ans |= z;;
    } return ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    for (int b = MD; b--; ) {
        if (invalid(b)) continue;
        if (int w = isWin(b); w) {
            if (w < 3) dp[b][w-1] = 1;
            continue;
        }
        for (int i = 0; i < 9; i++) {
            int turn = __builtin_popcount(b) & 1 ? 2 : 1;
            if (bitAt(b, i) == 0) {
                dp[b][0] += dp[b|turn<<i*2][0];
                dp[b][1] += dp[b|turn<<i*2][1];
            }
        }
    }
    cin >> T;
    for (int t = 0; t < T; t++) {
        int b = 0; string s; cin >> s;
        for (int i = 0; i < 9; i++)
            b |= (s[i] == 'O' ? 2 : s[i] == 'X') << i*2;
        if (!dp[b][0] && !dp[b][1]) printf("-1 -1\n");
        else printf("%d %d\n", dp[b][0], dp[b][1]);
    }


    return 0;
}