#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))
#define RREP(i, n)          for(int(i)=(n)-1;(i)>=0;--(i))
const int MOD = int(1e9+7);

int g[111],p[111];

int h(const char *s, const char *t, int n){
    int c = 0;
    REP(i,n) if(*(s+i) != *(t+i)) c++;
    return c;
}

int solve(const char *s, int n){
    REP(i,n-4+1) g[i] = h(s+i, "good", 4);
    REP(i,n-7+1) p[i] = h(s+i, "problem", 7);

    int minv = 1<<29;
    REP(i,n-4+1) FOR(j,i+4,n-7+1){
        minv = min(minv, g[i]+p[j]);
    }
    return minv;

}

int main(){
    do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0);
    int T; cin >> T;
    REP(i,T){
        string s; cin >> s;
        cout << solve(s.c_str(), s.size()) << endl;
    }
    return 0;
}