#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

string good = "good";
string problem = "problem";

int main(){
	int T;
	cin >> T;
	while(T--){
		string s;
		cin >> s;

		auto a = s.find(good);
		auto b = s.find(problem);

		if((a!=string::npos) && (b!=string::npos) && (a < b)){
			cout << 0 << endl;
			continue;
		}else{
			int ans = 1<<30;
			for(int i=0; i+good.size()+problem.size()<=s.size(); i++){
				int cost = 0;
				for(int j=0; j<good.size(); j++){
					if(s[i+j] != good[j]) cost++;
				}
				int cost_ = 1<<30;
				for(int j=i+4; j+problem.size()<=s.size(); j++){
					int cost__ = 0;
					for(int k=0; k<problem.size(); k++){
						if(s[j+k] != problem[k]) cost__++;
					}
					cost_ = min(cost_, cost__);
				}
				ans = min(ans, cost+cost_);
			}
			cout << ans << endl;
		}
	}
	return 0;
}