import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (tokens.empty && stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


immutable INF = 10^^9 + 1;

int V;
int[][] nxt;
int[] ac;
int[] fail;
int newNode() {
	nxt ~= new int[](26);
	nxt[$ - 1][] = -1;
	ac ~= 0;
	fail ~= -1;
	return V++;
}
void bfs() {
	int[] q;
	q ~= 0;
	for (; !q.empty; ) {
		const u = q[0]; q.popFront;
		foreach (e; 0 .. 26) {
			const v = nxt[u][e];
			if (v != -1) {
				fail[v] = u ? nxt[fail[u]][e] : 0;
				ac[v] |= ac[fail[v]];
				q ~= v;
			} else {
				nxt[u][e] = u ? nxt[fail[u]][e] : 0;
			}
		}
	}
}

int N;
string S;

void main(string[] args) {
	V = 0;
	newNode;
	foreach (k, s; [ "good", "problem" ]) {
		int u = 0;
		foreach (c; s) {
			const e = c - 'a';
			if (nxt[u][e] == -1) {
				nxt[u][e] = newNode;
			}
			u = nxt[u][e];
		}
		ac[u] = 1 << k;
	}
	bfs;
debug{
foreach(u;0..V)writeln("nxt[",u,"] = ",nxt[u]);
writeln("ac = ",ac);
}
	
	try {
	for (; ; ) {
		foreach (tc; 0 .. readInt) {
			S = readToken;
			N = cast(int)(S.length);
			
			auto dp = new int[][][](N + 1, 3, V);
			foreach (i; 0 .. N + 1) foreach (f; 0 .. 3) foreach (u; 0 .. V) {
				dp[i][f][u] = INF;
			}
			dp[0][0][0] = 0;
			foreach (i; 0 .. N) foreach (f; 0 .. 3) foreach (u; 0 .. V) if (dp[i][f][u] < INF) {
debug{
writeln(i," ",f," ",u,"; ",dp[i][f][u]);
}
				foreach (e; 0 .. 26) {
					const v = nxt[u][e];
					int ff = f;
					if (ac[v]) {
						if (f == 0 && (ac[v] & 1 << 1)) {
							continue;
						}
						if (ac[v] == 1 << f) {
							ff = f + 1;
						}
					}
debug{
writeln("  ",i+1," ",ff," ",v,"; ",dp[i][f][u] + ((S[i] - 'a' != e) ? 1 : 0));
}
					chmin(dp[i + 1][ff][v], dp[i][f][u] + ((S[i] - 'a' != e) ? 1 : 0));
				}
			}
			int ans = INF;
			foreach (u; 0 .. V) {
				chmin(ans, dp[N][2][u]);
			}
			writeln(ans);
			
		}
	}
	} catch (EOFException) {}
}