#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int Q; string s, t1 = "good", t2 = "problem";
int main() {
	cin >> Q;
	while (Q--) {
		cin >> s;
		vector<vector<int> > sum(5, vector<int>(s.size() + 1));
		for (int i = 0; i <= s.size() - 4; i++) {
			int cnt = 0;
			for (int j = 0; j < 4; j++) {
				if (s[i + j] != t1[j]) cnt++;
			}
			sum[cnt][i + 1]++;
		}
		for (int i = 0; i <= 4; i++) {
			for (int j = 0; j < s.size(); j++) {
				sum[i][j + 1] += sum[i][j];
			}
		}
		int ret = 999999999, pre = s.size();
		for (int i = 0; i <= s.size() - 7; i++) {
			int cnt = 0;
			for (int j = 0; j < 7; j++) {
				if (s[i + j] != t2[j]) cnt++;
			}
			if (i >= 4) {
				for (int j = 0; j <= 4; j++) {
					if (sum[j][i - 3]) ret = min(ret, cnt + j + (pre <= i - 7));
				}
			}
			if (cnt == 0 && pre == s.size()) pre = i;
		}
		cout << ret << endl;
	}
	return 0;
}