#include <bits/stdc++.h>

using namespace std;

int f[1 << 18], g[1 << 18];

int mp[3][3], cov = 0;

inline void cons(int S)
{
    cov = 0;
    for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (mp[i][j] = (S >> (i * 3 + j << 1) & 3)) cov ^= 1;
}

inline int Cons()
{
    int S = 0;
    for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) S |= mp[i][j] << (i * 3 + j << 1);
    return S;
}

inline bool ck(int x)
{
    for (int i = 0; i < 3; i++)
    {
        bool is = 1;
        for (int j = 0; j < 3; j++) if (mp[i][j] != x) { is = 0; break; }
        if (is) return true;
    }
    for (int i = 0; i < 3; i++)
    {
        bool is = 1;
        for (int j = 0; j < 3; j++) if (mp[j][i] != x) { is = 0; break; }
        if (is) return true;
    }
    return (mp[0][0] == x && mp[1][1] == x && mp[2][2] == x) || (mp[2][0] == x && mp[1][1] == x && mp[0][2] == x);
}

int main()
{
    for (int S = (1 << 18) - 1; S >= 0; S--)
    {
        bool is = 0;
        for (int i = 0; i < 9; i++) if ((S >> (i << 1) & 3) == 3) { is = 1; break; }
        if (is) continue;
        cons(S);
        bool f1 = ck(1), f2 = ck(2);
        if (f1 && f2) continue;
        if (f1) { f[S] = 1; continue; }
        if (f2) { g[S] = 1; continue; }
        int t = cov + 1;
        for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) if (!mp[i][j])
        {
            mp[i][j] = t;
            int T = Cons();
            f[S] += f[T], g[S] += g[T];
            mp[i][j] = 0;
        }
    }
    int Q; scanf("%d", &Q); while (Q--)
    {
        char s[11];
        scanf("%s", s);
        int S = 0;
        for (int i = 0; i < 9; i++) S |= (int(s[i] != '.') + int(s[i] == 'O')) << (i << 1);
        if (f[S] == 0 && g[S] == 0) puts("-1 -1");
        else printf("%d %d\n", f[S], g[S]);
    }
    return 0;
}