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

map<string,pair<int,int>> memo;

void solve([[maybe_unused]] int t){
    string s;
    cin>>s;
    
    const vector<array<int,3>> pos = {{0,1,2},{3,4,5},{6,7,8},{0,3,6},{1,4,7},{2,5,8},{0,4,8},{6,4,2}};
    
    auto win = [&](string ss,char c)->bool{
        for(auto [x,y,z] : pos){
            if(ss[x]==c && ss[y]==c && ss[z]==c)return true;
        }
        return false;
    };
    
    if(win(s,'X') && win(s,'O')){
        cout<<"-1 -1\n";
        return;
    }
    int contx=0,conto=0;
    for(auto i : s)if(i=='X')contx++;else if(i=='O')conto++;
    
    for(auto c : {'X','O'}){
        if(win(s,c)){
            bool ok=false;
            for(int i=0;i<(int)s.size();i++){
                if(s[i]!=c)continue;
                
                s[i]='.';
                ok|=!win(s,c);
                s[i]=c;
            }
            
            if(!ok){
                cout<<"-1 -1\n";
                return;
            }
            
            if(c=='O' && !(contx==conto)){
                cout<<"-1 -1\n";
                return;
            }
            
            if(c=='X' && !(contx==conto+1)){
                cout<<"-1 -1\n";
                return;
            }
        }
    }
    
    
    auto calc = [&](auto &calc,string s,int turno)->pair<int,int>{
        if(memo.find(s)!=memo.end())return memo[s];
        if(win(s,'O'))return {0,1};
        if(win(s,'X'))return {1,0};
        
        char c = (turno ? 'X' : 'O');
        
        pair<int,int> res;
        for(int i=0;i<(int)s.size();i++){
            if(s[i]=='.'){
                s[i]=c;
                auto tmp = calc(calc,s,turno^1);
                res.first+=tmp.first;
                res.second+=tmp.second;
                s[i]='.';
            }
        }
        
        return memo[s]=res;
    };
    
    auto ans = calc(calc,s,contx==conto);
    cout<<ans.first<<" "<<ans.second<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}