#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int T;
string s;
int main(){
    cin>>T;
    string s1 = "good";
    string s2 = "problem";
    REP(i,0,T){
        int ans=11;
        cin>>s;
        int n= s.size();
        int good[110] = {};
        int prob[110] = {};
        REP(i,0,n-6){
            REP(j,0,4){
                good[i] += (s[i+j] == s1[j]);
            }

            REP(j,0,7){
                prob[i] += (s[i+j] == s2[j]);
            }
        }
        RREP(i,1,n-6){
            prob[i-1]=max(prob[i-1], prob[i]);
        }
        REP(i,0,n-10){
            ans=min(ans, 11 - good[i] - prob[i+4]);
        }
        p(ans);
    }
    return 0;
}