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

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define f first
#define s second

ll p10[20];
map<ll, pair<int,int>> dp; // X, O

void do_permute(ll state) {
    ll tstate = state;
    short board[3][3];
    short cnt[2];
    cnt[0] = cnt[1] = 0;
    int mv = 0;
    for(int i=2; i>=0; i--){
        for(int j=2; j>=0; j--){
            board[i][j] = tstate%10;
            if(tstate%10) mv++;
            tstate /= 10; 
        }
    }
    // for(int i=0; i<3; i++){
    //     for(int j=0; j<3; j++){
    //         cout<<board[i][j];
    //     }
    //     cout<<"\n";
    // }
    // cout<<"\n";
    // if(mv==2) return;
    for(int i=0; i<3; i++){
        if(board[i][0] == 1 && board[i][1] == 1 && board[i][2] == 1) {
            dp[state] = make_pair(1,0);
            return;
        }
        if(board[i][0] == 2 && board[i][1] == 2 && board[i][2] == 2) {
            dp[state] = make_pair(0,1);
            return;
        }
    }
    for(int i=0; i<3; i++){
        if(board[0][i] == 1 && board[1][i] == 1 && board[2][i] == 1) {
            dp[state] = make_pair(1,0);
            return;
        }
        if(board[0][i] == 2 && board[1][i] == 2 && board[2][i] == 2) {
            dp[state] = make_pair(0,1);
            return;
        }
    }
    if(board[0][0] == 1 && board[1][1] == 1 && board[2][2] == 1) {
        dp[state] = make_pair(1,0);
        return;
    }
    if(board[0][0] == 2 && board[1][1] == 2 && board[2][2] == 2) {
        dp[state] = make_pair(0,1);
        return;
    }
    if(board[0][2] == 1 && board[1][1] == 1 && board[2][0] == 1) {
        dp[state] = make_pair(1,0);
        return;
    }
    if(board[0][2] == 2 && board[1][1] == 2 && board[2][0] == 2) {
        dp[state] = make_pair(0,1);
        return;
    }
    for(int i=0; i<3; i++){
        for(int j=0; j<3; j++){
            if(board[i][j] == 0) {
                ll n_state = state + p10[(2-i)*3+(2-j)] * (mv%2==0?1:2);
                // cout<<n_state<<"\n";
                if(!dp.count(n_state))
                    do_permute(n_state);
                dp[state].f += dp[n_state].f;
                dp[state].s += dp[n_state].s;
            }
        }
    }
}

ll calc_state(string board) {
    ll state = 0;
    for(char c:board) {
        state *= 10;
        if(c == '.') state += 0;
        else if(c == 'X') state += 1;
        else state += 2;
    }
    return state;
}
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }
    p10[0] = 1;
    for(int i=1; i<20; i++) p10[i] = p10[i-1] * (ll)10;
    do_permute(0);
    // cout<<"E";
    // return 0;
    int t; cin>>t;
    while(t--){
        string s; cin>>s;
        ll x = calc_state(s);
        // cout<<x<<" "<<"\n";
        if(dp.count(x)) {
            cout<<dp[x].f<<" "<<dp[x].s<<"\n";
        }
        else cout<<-1<<" "<<-1<<"\n";
    }
    
}