#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int main()
{
	int T; cin >> T;
	string problem = "problem";
	string good = "good";

	for (int t = 0; t < T; t++) {
		string s;
		cin >> s;
		int ans = 10000000000;

		for (int i = 0; i <= s.size() - 4 - 7; i++) {
			int res1 = 0;
			for (int k = 0; k < good.size(); k++) {
				if (s[i + k] != good[k])res1++;
			}
			for (int j = i + 4; j <= s.size() - 7; j++) {
				int res2 = 0;
				for (int k = 0; k < problem.size(); k++) {
					if (s[j + k] != problem[k])
						res2++;
				}
				ans = min(ans, res1 + res2);
			}
		}
		cout << ans << endl;
	}
	return 0;
}