#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int) N;i++)
#define p(s) cout<<(s)<<endl
using namespace std;
const int inf=1e9;

int main(){
	int T;
	cin>>T;
	string s;
	string good="good";
	string prob="problem";

	REP(i,0,T){
		cin>>s;
		int mn=inf;
		REP(j,0,s.size()-10){
			int cnt=0;
			REP(k,0,good.size()){
				cnt+= s[j+k]!=good[k];
			}
			REP(jj,j+4,s.size()-6){
				int cnt2=0;
				REP(k,0,prob.size()){
					cnt2+= s[jj+k]!=prob[k];
				}
				mn=min(mn,cnt+cnt2);
			}

		}
		p(mn);
	}
	return 0;
}