#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int q;
    cin >> q;
    string g = "good";
    string p = "problem";
    rep(loop,q){
        string s;
        cin >> s;
        int n = s.size();
        int ans = 1001001001;
        rep(i,n-10){
            srep(j,i+4,n-6){
                int tmp = 0;
                rep(k,4){
                    if(s[i+k] != g[k])tmp++;
                }
                rep(k,7){
                    if(s[j+k] != p[k])tmp++;
                }

                ans = min(ans, tmp);
            }
        }
        cout << ans << endl;
    }

    return 0;
}