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

map<string, pair<int,int>> dp;
map<string, bool> vis;
bool win(string &s, char c){
         string three= "";
         for(int i = 0; i < 9; i += 3){
                  if(s.substr(i, 3) == string(3, c))
                           return 1;
         }
         for(int i = 0; i < 3; i++){
                  bool good= 1;
                  for(int j = i; j < 9; j += 3){
                           good &= (s[j] == c);
                  }
                  if(good) return 1;
         }
         if(s[2] == s[4] && s[4] == s[6] && s[6] == c)
                  return 1;

         if(s[0] == s[4] && s[4] == s[8] && s[8] == c)
                  return 1;

         return 0;
}
pair<int,int> solve(string cur, int turn){
         if(dp.find(cur) != dp.end())
                  return dp[cur];

         auto &ret= dp[cur];
         ret= {0, 0};
         if(win(cur, 'X')) return ret= {1, 0};
         if(win(cur, 'O')) return ret= {0, 1};

         for(int i = 0; i < 9; i++){
                  if(cur[i] == '.'){
                           cur[i]= (turn ? 'X' : 'O');
                           auto nxt= solve(cur, turn ^ 1);
                           cur[i]= '.';
                           ret.first += nxt.first;
                           ret.second += nxt.second;
                  }
         }
         return ret;
}
void solve()
{
         string s; cin>>s;
         if(vis.find(s) == vis.end()){
                  cout<<"-1 -1\n";
                  return;
         }
         int xs= count(s.begin(), s.end(), 'X');
         int os= count(s.begin(), s.end(), 'O');

         int turn= 1;
         if(xs > os) turn = 0;
         auto ans= solve(s, turn);
         cout<<ans.first<<" "<<ans.second<<"\n";
}
int32_t  main() {
         cin.tie(0);
         cin.sync_with_stdio(0);

         queue<string> q; q.push(string(9, '.')); vis[string(9, '.')]= 1;
         while(q.size()){
                  string cur= q.front(); q.pop();
                  if(win(cur, 'X') || win(cur, 'O'))
                           continue;

                  int xs= count(cur.begin(), cur.end(), 'X');
                  int os= count(cur.begin(), cur.end(), 'O');
                  int turn= 1;
                  if(xs > os) turn = 0;
                  for(int i = 0; i < 9; i++){
                           if(cur[i] == '.'){
                                    cur[i]= (turn ? 'X' : 'O');
                                    if(vis.find(cur) == vis.end()){
                                             vis[cur]= 1;
                                             q.push(cur);
                                    }
                                    cur[i]= '.';
                           }
                  }
         }

         int T = 1; cin>>T;
         while(T--) solve();
}