#include <iostream>
#include <string>
#include <vector>
#include <limits>
#include <algorithm>

using namespace std;

int minCount(const string& s) {
	vector<int> goodCount(s.size() - 4 + 1);
	for (size_t i = 0; i < s.size() - 4 + 1; ++i) {
		for (size_t k = 0; k < 4; ++k) {
			if (s[i + k] != "good"[k]) {
				++goodCount[i];
			}
		}
	}
	vector<int> problemCount(s.size() - 7 + 1);
	for (size_t i = 0; i < s.size() - 7 + 1; ++i) {
		for (size_t k = 0; k < 7; ++k) {
			if (s[i + k] != "problem"[k]) {
				++problemCount[i];
			}
		}
	}
	int minCount = numeric_limits<int>::max();
	for (size_t i = 0; i < s.size() - 11 + 1; ++i) {
		for (size_t k = i + 4; k < s.size() - 7 + 1; ++k) {
			minCount = min(minCount, goodCount[i] + problemCount[k]);
		}
	}
	return minCount;
}

int main() {
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		string s;
		cin >> s;
		cout << minCount(s) << endl;
	}
	return 0;
}