#pragma GCC optimize("O3")
#include <iostream>
using namespace std;
#include <vector>
#define pb push_back
template<class C> using vc=vector<C>;
#include <map>
#define For(i,a,b) for(int i=(a);i<(b);i++)
#define smax(a,b) a=max(a,b)
#define f first
#define s second
typedef pair<int,int> pi;

int p[9]{1,3,9,27,81,243,729,2187,6561}, a[19683], b[19683];
vc<vc<int>> lines{
    {0,1,2},{3,4,5},{6,7,8},
    {0,3,6},{1,4,7},{2,5,8},
    {0,4,8},{2,4,6}
};
//unvisited: -1/-1
//else a = no. ways X wins, b for O
void dfs(int pos, bool pl)
{
    if(a[pos]+b[pos]>0) return;
    a[pos]=b[pos]=0;
    //test if player 1-p won
    for(vc<int> v:lines)
    {
        bool good=1;
        for(int t:v) if((pos/p[t])%3!=2-pl) good=0;
        if(good)
        {
            a[pos]=pl, b[pos]=!pl;
            return;
        }
    }
    //sum over each move
    For(t,0,9) if((pos/p[t])%3==0)
    {
        int npos=pos+p[t]*(1+pl);
        dfs(npos,!pl), a[pos]+=a[npos], b[pos]+=b[npos];
    }
}
int main()
{
    cin.sync_with_stdio(0), cin.tie(0), cout.sync_with_stdio(0), cout.tie(0);
    For(i,0,19683) a[i]=b[i]=-1; dfs(0,0);
    map<char,int> m; m['X']=1, m['O']=2, m['.']=0; int q; cin>>q;
    For(i,0,q)
    {
        int pos=0; char c;
        For(j,0,9) cin>>c, pos=3*pos+m[c]; //ok since symmetry
        cout<<a[pos]<<' '<<b[pos]<<'\n';
    }
}