#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

map<string, pii> dp;

pii operator+(const pii &a, const pii &b) { return pii(a.X + b.X, a.Y + b.Y); }

pii get_dp(string s) {
    if (dp.find(s) != dp.end()) return dp[s];
    for (int i = 0; i < 3; ++i) {
        string tmp;
        for (int j = i * 3; j < i * 3 + 3; ++j)
            tmp.pb(s[j]);
        if (tmp == string(3, 'O')) return dp[s] = pii(0, 1);
        if (tmp == string(3, 'X')) return dp[s] = pii(1, 0);
    }
    for (int i = 0; i < 3; ++i) {
        string tmp;
        for (int j = i; j < 9; j += 3)
            tmp.pb(s[j]);
        if (tmp == string(3, 'O')) return dp[s] = pii(0, 1);
        if (tmp == string(3, 'X')) return dp[s] = pii(1, 0);
    }
    {
        string tmp;
        tmp.pb(s[0]), tmp.pb(s[4]), tmp.pb(s[8]);
        if (tmp == string(3, 'O')) return dp[s] = pii(0, 1);
        if (tmp == string(3, 'X')) return dp[s] = pii(1, 0);
    }
    {
        string tmp;
        tmp.pb(s[2]), tmp.pb(s[4]), tmp.pb(s[6]);
        if (tmp == string(3, 'O')) return dp[s] = pii(0, 1);
        if (tmp == string(3, 'X')) return dp[s] = pii(1, 0);
    }
    int x = 0, o = 0;
    for (char c : s)
        if (c == 'X') ++x;
        else if (c == 'O') ++o;
    pii res = pii(0, 0);
    char nxt = (x == o) ? 'X' : 'O';
    for (char &c : s) {
        if (c == '.') {
            c = nxt;
            res = res + get_dp(s);
            c = '.';
        }
    }
    return dp[s] = res;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    get_dp(string(9, '.'));
    int t;
    cin >> t;
    while (t--) {
        string s;
        cin >> s;
        if (dp.find(s) == dp.end()) cout << "-1 -1\n";
        else cout << dp[s].X << " " << dp[s].Y << "\n";
    }
}