#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

string g = "good";
string p = "problem";
int diff(string s, string &p) {
	int res = 0;
	for (int i = 0; i < p.size(); i++) {
		res += (s[i] != p[i]);
	}
	return res;
}

void solve() {
	string s; cin >> s;
	vector<int> mn(s.size() + 1, inf);
	vector<int> cnt(s.size() + 1);
	for (int i = (int)s.size() - (int)p.size(); i >= 0; i--) {
		mn[i] = diff(s.substr(i, p.size()), p);
		chmin(mn[i], mn[i + 1]);
	}
	for (int i = (int)p.size() - 1; i <s.size(); i++) {
		if (diff(s.substr(i + 1 - (int)p.size(), p.size()), p) == 0) cnt[i + 1] += 1;
		cnt[i + 1] += cnt[i];
	}
	int res = inf;
	for (int i = 0; i + 3 < (int)s.size() - (int)p.size(); i++) {
		int ans = diff(s.substr(i, 4), g) + mn[i + 4] + cnt[i];
		chmin(res, ans);
	}
	cout << res << "\n";
}

int main()
{
    
    cin.tie(nullptr);
    ios::sync_with_stdio(false);


	int kkt; cin >> kkt;
	while (kkt--) {
		solve();
	}
    return 0;
}