#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<queue>
#include<bitset>
#include<array>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<numeric>
#define D int
#define U unsigned
using namespace std;
D n, m,a, b, d, e, x, y, z;
D i, j, k;
char c,f;
string s;
bool f1;
D p[1000001],q[1000001],r[1000001];
int main() {
	cin >> a;
	D t;
	for (i = 0; i < a; i++) {
		cin >> s;
		t=s.size();
		for (j = 0; j <= t - 7; j++) {
			p[j] = 0;
			for (k = 0; k < 7; k++) {
				if (s[j + k] != "problem"[k])
					p[j]++;
			}
			r[j] = r[j - 1];
			if (!p[j])
				r[j]++;
		}
		for (j = t - 8; j >= 0; j--) {
			p[j] = min(p[j], p[j + 1]);
		}
		for (j = 0; j <= t-11; j++) {
			q[j] = 0;
			for (k = 0; k < 4; k++) {
				if (s[j + k] != "good"[k])
					q[j]++;
			}
			if(j>=7)
				q[j] += r[j-7];
		}
		n = q[0]+p[4];
		for (j = 1; j <= t - 11; j++) {
			n=min(n, q[j]+p[j + 4]);
		}
		cout << n << endl;
	}
}