#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


const int maxn=3e5+10;

struct state{
    int a[3][3];

    state(){memset(a,0,sizeof(a));}
    state(string s){

        for(int i=0;i<s.size();i++){
            int val=0;
            if(s[i]=='X')val=1;
            else if(s[i]=='O')val=2;

            a[i/3][i%3]=val;
        }

    }

    bool iswinner(int x){

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

        int e=1;
        for(int i=0;i<3;i++)if(a[i][i]!=x)e=0;
        if(e)return 1;

        if(a[2][0]!=x || a[1][1]!=x || a[0][2]!=x)return false;
        else return true;
    }

    int get_winner(){
        if(iswinner(1))return 1;
        if(iswinner(2))return 2;
        return 0;
    }

    string get_string() const{
        string s;
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++)s.pb(a[i][j]+'0');
        }
        return s;
    }

    bool operator <(const state &b)const {
        return get_string()<b.get_string();
    }

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

}ststate;

typedef pair<ll,ll> pll;
map<state,bool>pos;
map<state,pll>dp;

void prek(){

    pos[ststate]=1;

    queue<state>q;
    q.push(ststate);

    while(q.size()){

        state x=q.front();
        q.pop();

        if(x.get_winner()!=0)continue;

        int currpl=x.get_current();

        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){

                if(x.a[i][j]==0){
                    state pom=x;
                    pom.a[i][j]=currpl;
                    if(pos.find(pom)==pos.end()){
                        pos[pom]=1;
                        q.push(pom);
                    }
                }

            }
        }

    }

}

pll operator +(pll a,pll b){
    return {a.ff+b.ff,a.ss+b.ss};
}

pll go(state x){

    if(dp.find(x)!=dp.end())return dp[x];
    pll &a=dp[x];
    a={0,0};

    int winner=x.get_winner();
    if(winner!=0){
        if(winner==1)a.ff=1;
        else a.ss=1;
    }
    else{

        int currpl=x.get_current();
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){

                if(x.a[i][j]==0){
                    state pom=x;
                    pom.a[i][j]=currpl;
                    a=a+go(pom);
                }

            }
        }

    }

    return a;
}

int main(){

    ///freopen("test.txt","r",stdin);

    prek();

    int t;
    scanf("%d",&t);
    while(t--){

        string s;
        cin>>s;

        state st(s);

        if(pos.find(st)==pos.end()){
            printf("-1 -1\n");
            continue;
        }

        pll rez=go(st);

        printf("%lld %lld\n",rez.ff,rez.ss);

    }

    return 0;
}