#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int T;
	cin >> T;
	string S;
	const string A = "good", B = "problem";
	while(cin >> S) {
		int n = S.size();
		vector<int> sufcost(n+1);
		sufcost[n] = INF;
		for(int i = n-1; i >= 0; -- i) {
			int x;
			if(i + 7 <= n) {
				x = 0;
				rep(j, 7)
					x += S[i + j] != B[j];
			}else {
				x = INF;
			}
			amin(x, sufcost[i+1]);
			sufcost[i] = x;
		}
		int addcost = 0;
		int ans = INF;
		rer(i, 0, n - 11) {
			int x = 0, y = 0;
			rep(j, 4) x += S[i + j] != A[j];
			rep(j, 7) y += S[i + j] != B[j];
			if(y == 0)
				++ addcost, -- x;
			amin(ans, addcost + x + sufcost[i + 4]);
		}
		printf("%d\n", ans);
	}
	return 0;
}