#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())



const string good="good",problem="problem";



int main(){
	int t;
	cin>>t;
	rep(_,t){
		string s;
		cin>>s;
		vector<int> repP(s.size(),INF);
		int n=s.size();
		for(int i=n-problem.size();i>=0;i--){
			int cnt=0;
			for(int j=0;j<problem.size();j++){
				cnt+=problem[j]!=s[i+j];
			}
			repP[i]=min(cnt,repP[i+1]);
		}
		int ans=INF,c=0;
		for(int i=0;i<=n-good.size()-problem.size();i++){
			if(problem.size()<=i){
				if(s.substr(i-problem.size(),problem.size())==problem)c++;
			}
			int cnt=0;
			for(int j=0;j<good.size();j++){
				cnt+=good[j]!=s[i+j];
			}
			ans=min(ans,c+cnt+repP[i+good.size()]);
		}
		cout<<ans<<endl;
	}
	return 0;
}