#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;
	vector<int> v;
	string problem = "problem",good = "good";

	for (int i = 0; i < T; i++) {
		string s; cin >> s;
		int mx_p = 0, mx_g = 0, mx_g2 = 0, ind = 4;
		for (int k = 4; k < s.size() - 6; k++) {
			string str = s.substr(k, 7);
			int cnt = 0;

			for (int j = 0; j < str.size(); j++) {
				if (problem[j] == str[j])cnt++;
			}
			if (mx_p <= cnt) {
				mx_p = cnt;
				ind = k;
			}
		}
		for (int k = 0; k < ind - 3; k++) {
			string str = s.substr(k, 4);
			int cnt = 0;
			for (int j = 0; j < str.size(); j++) {
				if (good[j] == str[j])cnt++;
			}
			mx_g = max(mx_g, cnt);
		}

		for (int k = 0; k < s.size() -10; k++) {
			string str = s.substr(k, 4);
			int cnt = 0;
			for (int j = 0; j < str.size(); j++) {
				if (good[j] == str[j])cnt++;
			}
			mx_g2 = max(cnt, mx_g2);
		}

		if ( (mx_g2 > mx_g) && (mx_g2 > mx_p)) {
			mx_g = mx_g2;
			int cnt = 0;
			for (int k = s.size() - 7,j=0; k < s.size(); k++,j++) {
				if (s[k] == problem[j])cnt++;
			}
			mx_p = cnt;
		}
		//cout << 11 - mx_p - mx_g << endl;
		v.push_back(11 - mx_p - mx_g);
	}

	for (int i = 0; i < v.size(); i++) {
		cout << v[i] << endl;
	}
	return 0;
}