#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);


string prob = "problem";
string good = "good";
void solve() {
	string s; cin >> s;
	int n = s.size();
	vector<int> mi(n+1);
	mi[n] = mod;
	per(i, n) {
		mi[i] = mi[i + 1];
		if (i + 7 <= n) {
			int cost = 0;
			rep(j, 7) {
				if (prob[j] != s[i + j]) {
					cost++;
				}
			}
			mi[i] = min(mi[i], cost);
		}
	}
	vector<int> pre(n+1);
	//[0,i)
	rep(i, n) {
		pre[i + 1] = pre[i]; 
		if (i >= 6) {
			int c = 0;
			rep(j, 7) {
				if (s[i - 6 + j] != prob[j])c++;
			}
			if (c == 0)pre[i + 1]++;
		}
	}
	int ans = mod;
	rep(i, n - 11 + 1) {
		int cost = 0;
		rep(j, 4) {
			if (s[i + j] != good[j])cost++;
		}
		cost += pre[i];
		cost += mi[i + 4];
		ans = min(ans, cost);
	}
	cout << ans << "\n";
}


signed main() {
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	int t; cin >> t; rep(i, t)
	solve();
	return 0;
}