#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };


int main() {
	int t;
	cin >> t;


	rep(i, 0, t) {
		string s;
		cin >> s;
		int sz = s.size();
		string gd = "good";
		string pr = "problem";


		int ans = 101010;
		for (int g = 0; g <= sz - 11;g++) {
			for (int p = g + 4; p <= sz-7; p++) {
				int cnt = 0;
				for (int l = g; l <= g + 3; l++) {
					if (s[l] != gd[l - g])cnt++;
				}
				for (int r = p; r <= p + 6; r++) {
					if (s[r] != pr[r - p])cnt++;
				}
				ans = min(cnt,ans);
			}
		}
		cout << ans << endl;
	}
	return 0;
}