#include <bits/stdc++.h>

using namespace std;

int pw3[15];

inline int calc(int S, int i, int j) { return (S / pw3[i * 3 + j]) % 3; }

inline int check(int S) {
    // check row
    for (int i = 0; i < 3; ++i) {
        int val = calc(S, i, 0);
        if (val && calc(S, i, 1) == val && calc(S, i, 2) == val) return val;
    }
    // check col
    for (int i = 0; i < 3; ++i) {
        int val = calc(S, 0, i);
        if (val && calc(S, 1, i) == val && calc(S, 2, i) == val) return val;
    }
    int val = calc(S, 0, 0);
    if (val && calc(S, 1, 1) == val && calc(S, 2, 2) == val) return val;
    val = calc(S, 0, 2);
    if (val && calc(S, 1, 1) == val && calc(S, 2, 0) == val) return val;
    return 0;
}

int reach[60005];
int f[60005][2];
int a[60005];

inline void solve(){
    char buf[20]; scanf("%s", buf);
    int S = 0;
    for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) {
        if (buf[i * 3 + j] == 'X') S += 1 * pw3[i * 3 + j];
        if (buf[i * 3 + j] == 'O') S += 2 * pw3[i * 3 + j];
    }
    if (!reach[S]) printf("%d %d\n", -1, -1);
    else printf("%d %d\n", f[S][0], f[S][1]);
    return;
}

int main(){
    pw3[0] = 1; for (int i = 1; i <= 9; ++i) pw3[i] = 1ll * pw3[i - 1] * 3;
    // 1 for X, 2 for O
    for (int S = 0; S < pw3[9]; ++S) {
        a[S] = check(S);
    }

    for (int S = pw3[9] - 1; S >= 0; --S) {
        if (a[S]) f[S][a[S] - 1] = 1;
        else {
            int cnt = 0;
            for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) cnt += (calc(S, i, j) != 0);
            for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j)
                if (calc(S, i, j) == 0) {
                    int nS = S;
                    if (cnt % 2 == 0) nS += 1 * pw3[i * 3 + j]; // go X
                    else nS += 2 * pw3[i * 3 + j]; // go O;
                    f[S][0] += f[nS][0], f[S][1] += f[nS][1];
                }
        }
    }

    reach[0] = 1;
    for (int S = 0; S < pw3[9]; ++S) if (reach[S]){
        if (!a[S]) {
            int cnt = 0;
            for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) cnt += (calc(S, i, j) != 0);
            for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j)
                if (calc(S, i, j) == 0) {
                    int nS = S;
                    if (cnt % 2 == 0) nS += 1 * pw3[i * 3 + j]; // go X
                    else nS += 2 * pw3[i * 3 + j]; // go O;
                    reach[nS] = 1;
                }
        }
    }

    int T;
    for (scanf("%d", &T); T--; solve());
    return 0;
}