#include <bits/stdc++.h>
using namespace std;

#define lp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) lp(i, 0, n)
#define rlp(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define rrep(i, n) rlp(i, 0, n)

#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(c) begin(c), end(c)

typedef long long ll;
typedef unsigned long long ull;

template<typename T>
inline bool chmin(T &a, T b){
	if (a <= b) return false;
	a = b; return true;
}

template<typename T>
inline bool chmax(T &a, T b){
	if (a >= b) return false;
	a = b; return true;
}

template<typename T>
inline void unique(T &c){
	sort(all(c));
	c.erase(unique(all(c)), end(c));
}

template<typename T>
inline T sq(T a){
	return a * a;
}

string s, t = "goodproblem";
int dp[1000010][13];

int solve()
{
	fill(*begin(dp), *end(dp), 1 << 28);
	dp[0][0] = 0;
	rep(i, s.size()) rep(j, t.size() + 1){
		chmin(dp[i + 1][j], dp[i][j]);
		chmin(dp[i + 1][j + 1], dp[i][j] + (s[i] != t[j]));
	}
	return dp[s.size()][t.size()];
}

int main()
{
	int n;
	cin >> n;
	while (n--){
		cin >> s;
		s = " " + s;
		cout << solve() << endl;
	}
}