#define _CRT_SECURE_NO_WARNINGS
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

bool sort_greater(const pair<string, int> &a, const pair<string, int> &b) {
	return a.second > b.second;
}

void solve() {
	int n;
	cin >> n;
	string g = "good", p = "problem";
	queue<int> q;
	rep(i, n){
		string s;
		cin >> s;
		int maxi1 = 0;
		int pos = 0;
		int mini = 1000000;
		REP(j, 4, s.length()){
			if (j + 6 >= s.length())continue;
			int count = 0;
			rep(k, 7){
				if (s[j + k] == p[k]){
					count++;
				}
			}
			int count2;
			rep(l, j){
				if (l + 3 >= j)continue;
				count2 = 0;
				rep(m, 4){
					if (s[l + m] == g[m]){
						count2++;
					}
				}
				if (mini > 11 - count - count2){
					mini = min(mini, 11 - count - count2);
				}
			}
		}
		q.push(mini);
	}
	while (!q.empty()){
		P(q.front());
		q.pop();
	}
}

int main() {
	solve();
	return 0;
}