#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

#define ll long long
#define ld long double


const int N = 5005 + 9, mod = 998244353;
const ll OO = 1e9;
int row(vector<int> grid) {
    for(int i = 0;i < 9;i += 3) {
        int same = grid[i];
        for(int j = i;j < i + 3;j++) {
            if(grid[j] != same) {
                same = -1;
                break;
            }
        }
        if(same != -1)
            return same;
    }
    return -1;
}
int col(vector<int> grid) {
    for(int i = 0;i < 3;i++) {
        int same = grid[i];
        for(int j = i;j < 9;j += 3) {
            if(grid[j] != same) {
                same = -1;
                break;
            }
        }
        if(same != -1)
            return same;
    }
    return -1;
}
int D1(vector<int> grid) {
    int same = grid[0];
    for(int i : {4, 8}) {
        if(same != grid[i])
            return -1;
    }
    return same;
}
int D2(vector<int> grid) {
    int same = grid[2];
    for(int i : {4, 6}) {
        if(same != grid[i])
            return -1;
    }
    return same;
}
int win(vector<int> grid) {
    int stateRow = row(grid);
    if(stateRow != -1)
        return stateRow;
    int stateCol = col(grid);
    if(stateCol != -1)
        return stateCol;
    int stateD1 = D1(grid);
    if(stateD1 != -1)
        return stateD1;
    int stateD2 = D2(grid);
    return stateD2;
}
bool full(vector<int> grid) {
    for(auto i : grid) {
        if(i == -1)
            return false;
    }
    return true;
}
vector<int> input;
set<vector<int>> found;
map<pair<vector<int>, int>, int> dp;
void gen(vector<int> grid, int turn) {
//    for(auto i : grid)
//        cout << i << " ";
//    cout << endl << endl;
    found.insert(grid);
    if(win(grid) != -1)
        return;
    if(full(grid))
        return;
    for(int i = 0;i < 9;i++) {
        if(grid[i] == -1) {
            grid[i] = turn;
            gen(grid, turn ^ 1);
            grid[i] = -1;
        }
    }
}
int solve(vector<int> grid, int turn, int cur) {
    int state = win(grid);
    if(state != -1)
        return state == cur;
    if(full(grid))
        return 0;
    if(dp.count({grid, cur}))
        return dp[{grid, cur}];
    int cnt = 0;
    for(int i = 0;i < 9;i++) {
        if(grid[i] == -1) {
            grid[i] = turn;
            cnt += solve(grid, turn ^ 1, cur);
            grid[i] = -1;
        }
    }
    return dp[{grid, cur}] = cnt;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    vector<int> tmp(9, -1);
    gen(tmp, 1);
    int t;
    cin >> t;
    while(t--) {
        string s;
        cin >> s;
        input.clear();
        int x = 0, o = 0;
        for(auto i : s) {
            if(i == '.')
                input.push_back(-1);
            else if(i == 'X')
                x++, input.push_back(1);
            else
                o++, input.push_back(0);
        }
        if(!found.count(input)) {
            cout << "-1 -1\n";
            continue;
        }
        cout << solve(input, o == x, 1) << " " << solve(input, o == x, 0) << '\n';
    }
    return 0;
}
/*
 4
XX..O....
X...OX...
OOOX.X.X.
OOOXXX...

 */