UVA 10651

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

const int OO = 1e9;
const double EPS = 1e-9;


int mem[(1 << 13)];

int solve(bitset<12> msk) {
    if(msk.count() == 0) {
        return 0;
    }
    if(mem[msk.to_ullong()] != -1) {
        return mem[msk.to_ullong()];
    }
    int &ret = mem[msk.to_ullong()];
    ret = msk.count();
    for(int i = 0; i < 10; i++) {
        if(!msk[i] && msk[i+1] && msk[i+2]) {
            bitset<12> curr = msk;
            curr[i] = 1;
            curr[i+1] = curr[i+2] = 0;
            ret = min(ret,solve(curr));
        }
        else if(msk[i] && msk[i+1] && !msk[i+2]) {
            bitset<12> curr = msk;
            curr[i+2] = 1;
            curr[i] = curr[i+1] = 0;
            ret = min(ret,solve(curr));
        }
    }
    return ret;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    cin >> t;
    while(t--) {
        memset(mem,-1,sizeof(mem));
        bitset<12> msk;
        for(int i = 0; i < 12; i++) {
            char c;
            cin >> c;
            msk[i] = (c == 'o');
        }
        cout << solve(msk) << "\n";
    }

    return 0;
}