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

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll humming(string s, string t){
    if(s.size()!=t.size()){
        return -1;
    }

    ll count = 0;
    ll L = s.size();
    FOR(i, 0, L){
        if(s[i]!=t[i]) count++;
    }
    return count;
}

ll how_many(string s){
    ll L = s.size();
    string good = "good";
    string problem = "problem";

    ll min_dist = inf;
    FOR(i, 0, L){
        FOR(j, i+4, L-7+1){
            ll dist0 = humming(s.substr(i, 4), "good");
            ll dist1 = humming(s.substr(j, 7), "problem");
            min_dist = min(min_dist, dist0+dist1);
            // pn(i);
            // pn(j);
            // pn(dist0);
            // pn(dist1);
        }
    }
    return min_dist;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll T;
    cin >> T;

    FOR(i, 0, T){
        string s;
        cin >> s;

        ll ans = how_many(s);
        p(ans);
    }
    
    return 0;
}