#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

using namespace std;

typedef pair<int,int> P;
typedef long long int LL;

string s[100];
string good="good";
string problem="problem";

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin>>t;
	REP(k,t)	cin>>s[k];
	int ans;
	REP(i,t){
		ans=10000;
		REP(j,SZ(s[i])-4-7+1){
			int c=0;
			REP(k,4){
				if(s[i][j+k]!=good[k]){
					c++;
				}
			}
			FOR(k,j+4,SZ(s[i])-7+1){
				int t=0;
				REP(l,7){
					if(s[i][k+l]!=problem[l]){
						t++;
					}
				}
				ans=min(ans,c+t);
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}