#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 100000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	int t;
	cin >> t;
	int ans[100];
	string g = "good";
	string p = "problem";
	int t1 = t;
	while (t1--) {
		string s;
		cin >> s;
		int mi = INF;
		int pos = 0;
		REP(i, s.size() - 10) {
			int cnt = 0;
			REP(j, 4) {
				if (g[j] != s[i + j]) cnt++;
			}
			FOR(j, i + 4, s.size() - 6) {
				REP(k, 7) {
					if (p[k] != s[j + k]) cnt++;
				}
				mi = min(mi, cnt);
			}
		}
		ans[t - t1 - 1] = mi;
	}
	REP(i, t) {
		cout << ans[i] << endl;
	}
	return 0;
}