#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull=unsigned long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using pll = pair<ll,ll>;
#define endl '\n'
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(v) ((int)(v).size())
#define all(v) v.begin(), v.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define lb(v,x) lower_bound(all(v),x)
#define ub(v,x) upper_bound(all(v),x)
//#define uniq(v) v.resize()
template<typename T, typename S>
istream& operator>>(istream& in, pair<T,S>& p){
    in >> p.fi >> p.se;
    return in;
}
template<typename T, typename S>
ostream& operator<<(ostream& out, pair<T,S>& p){
    out << p.fi << ' ' << p.se;
    return out;
}
const int maxn=300055, mx=20055;
const int mod=1e9+7, mod2=998244353;
const int inf=2e9;
const ll infl=1LL<<62;
using tpl=tuple<int,int,int>;
int n,m,k;

pii st[mx];
pii operator+(pii a, pii b){
    return {a.fi+b.fi, a.se+b.se};
}

int brd[2][4][4]; // 1 x 2 o



bool chk(int x){
    for(int i=1;i<=3;i++){
        bool f=1;
        for(int j=1;j<=3;j++) f&=(brd[0][i][j]==x);
        if(f) return true;
    }
    for(int j=1;j<=3;j++){
        bool f=1;
        for(int i=1;i<=3;i++) f&=(brd[0][i][j]==x);
        if(f) return true;
    }
    bool f=1;
    for(int i=1;i<=3;i++){
        f&=(brd[0][i][i]==x);
    }
    if(f) return true;
    f=1;
    for(int i=1;i<=3;i++){
        f&=(brd[0][i][4-i]==x);
    }
    if(f) return true;
    return false;
}


void mk(int x){
    int xx=x;
    int cnt[4]={0,};
    for(int i=1;i<=3;i++){
        for(int j=1;j<=3;j++){
            brd[0][i][j]=x%3;
            cnt[x%3]++;
            x/=3;
        }
    }
}

string s;

int cvrt(){
    int res=0;
    for(int i=8;i>=0;i--){
        res*=3;
        if(s[i]=='X') res+=1;
        else if(s[i]=='O') res+=2;
    }
    return res;
}

void dfs(int x, int dep){
    mk(x);
    if(chk(1)){
        st[x]={1,0};
        return;
    }
    if(chk(2)) {
        st[x]={0,1};
        return;
    }
    st[x]={0,0};
    if(dep==9){
        return;
    }
    
    for(int i=1;i<=3;i++){
        for(int j=1;j<=3;j++){
            mk(x);
            int r=1;
            for(int k=1;k<=3*(i-1)+j-1;k++) r*=3;
            if(brd[0][i][j]) continue;
            int nx=x+r*(dep&1?2:1);
            dfs(nx,dep+1);
            st[x]=st[x]+st[nx];
        }
    }
}

void solve(int tc){
    fill(st,st+mx,pii(-1,-1));
    dfs(0,0);
    
    cin >> tc;
    while(tc--){
        cin >> s;
        cout << st[cvrt()] << endl;
    }
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
#else
    fastio;
#endif
    int tc=1;
//    cin >> tc;
    for(int i=1;i<=tc;i++) solve(i);
}