#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
using namespace std;

int main() {
	int T;
	cin >> T;
	for (int i = 0; i < T; ++i) {
		string S;
		cin >> S;
		int ans = INT_MAX;
		for (size_t j = 0; j < S.size() - 10; ++j) {
			int tmp1 = 0;
			for (size_t k = 0; k < 4; ++k) {
				if (S[j + k] != "good"[k]) ++tmp1;
			}
			for (size_t k = j + 4; k < S.size() - 6; ++k) {
				int tmp2 = 0;
				for (size_t l = 0; l < 7; ++l) {
					if (S[k + l] != "problem"[l]) ++tmp2;
				}
				ans = min(tmp1 + tmp2, ans);
			}
		}
		cout << ans << endl;
	}
}