#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int match(string a, string b) {
	if(a.size() != b.size()) { return 12; }
	int v = 0;
	inc(i, b.size()) { if(a[i] != b[i]) { v++; } }
	return v;
}

int v[2][1000000];
int w[3][1000000];

int main() {
	int t;
	cin >> t;
	inc(q, t) {
		string s;
		cin >> s;
		
		inc(i, s.size()) {
			v[0][i] = match(s.substr(i, 4), "good");
			v[1][i] = match(s.substr(i, 7), "problem");
		}
		
		inc(i, s.size()) { w[2][i] = (i < 7 ? 0 : w[2][i - 1] + (v[1][i - 7] == 0)); }
		inc(i, s.size()) { w[0][i] = min(v[0][i], (i ==            0 ? 12 : w[0][i - 1])) + w[2][i]; }
		dec(i, s.size()) { w[1][i] = min(v[1][i], (i == s.size() - 1 ? 12 : w[1][i + 1])); }
		
		int ans = 12;
		inc(i, s.size() - 4) {
			setmin(ans, w[0][i] + w[1][i + 4]);
		}
		
		cout << ans << "\n";
	}
	
	return 0;
}