#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pl3 tuple<ll, ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()

using namespace std;

map<string, pii> result;

void dfs(string s)
{
    if (result.find(s) != result.end())
        return;

    auto check = [&](int a, int b, int c)
    {
        if (s[a] == s[b] && s[b] == s[c] && s[c] != '.')
            return s[a];
        return (char)0;
    };
    char win = check(0, 1, 2) | check(3, 4, 5) | check(6, 7, 8) | check(0, 3, 6) | check(1, 4, 7) | check(2, 5, 8) | check(0, 4, 8) | check(2, 4, 6);
    if (win)
    {    
        result[s] = pii(win == 'X', win == 'O');
        return;
    }

    int cnt = 0;
    for (auto c : s)
        cnt += (c == 'X') - (c == 'O');
    char nxt = (cnt > 0 ? 'O' : 'X');
    for (int i = 0; i < 9; i++)
        if (s[i] == '.')
        {
            string t = s;
            t[i] = nxt;
            dfs(t);
            result[s].F += result[t].F, result[s].S += result[t].S;
        }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    dfs(".........");
    int t;
    cin >> t;
    while (t--)
    {
        string s;
        cin >> s;
        if (result.find(s) == result.end())
            cout << -1 << ' ' << -1 << '\n';
        else
            cout << result[s].F << ' ' << result[s].S << '\n';
    }
}