#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

int is_end(string st) {
    for (int i=0; i<3; ++i) {
        if (st[3*i] == st[3*i+1] && st[3*i] == st[3*i+2]) {
            if (st[3*i] == 'X') return 0;
            else if (st[3*i] == 'O') return 1;
        }
        if (st[i] == st[i+3] && st[i] == st[i+6]) {
            if (st[i] == 'X') return 0;
            else if (st[i] == 'O') return 1;
        }
    }
    if (st[0] == st[4] && st[0] == st[8]) {
        if (st[0] == 'X') return 0;
        else if (st[0] == 'O') return 1;
    }
    if (st[2] == st[4] && st[2] == st[6]) {
        if (st[2] == 'X') return 0;
        else if (st[2] == 'O') return 1;
    }
    return -1;
}

map<string, pii> mp;

pii solve(string st, int turn) {
    int r = is_end(st);
    if (r != -1) return (mp[st] = (r == 0 ? pii{ 1, 0 } : pii{ 0, 1 }));

    pii ret = { 0, 0 };
    for (int i=0; i<9; ++i) {
        if (st[i] == '.') {
            st[i] = (turn == 0 ? 'X' : 'O');
            auto tmp = solve(st, turn^1);
            ret.first += tmp.first;
            ret.second += tmp.second;
            st[i] = '.';
        }
    }
    return (mp[st] = ret);
}

void solve() {
    string init;
    for (int i=0; i<9; ++i) init += '.';
    solve(init, 0);

    int t;
    cin >> t;
    for (int i=0; i<t; ++i) {
        string s;
        cin >> s;
        if (mp.find(s) == mp.end()) {
            cout << "-1 -1\n";
        } else {
            auto r = mp[s];
            cout << r.first << ' ' << r.second << '\n';
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    solve();
}