LenA = 4
LenB = 7
A = "good"
B = "problem"


def solve(S):
    N = len(S)
    sumB = [0] * N

    for i in range(LenB, N):
        sumB[i] = sumB[i - 1]
        if S[i - LenB: i] == B:
            sumB[i] += 1
    minAmoves = [N] * N
    for i in range(0, N - LenA + 1):
        count = 0
        for d in range(LenA):
            if S[i + d] != A[d]:
                count += 1
        minAmoves[i] = count + sumB[i]
        minAmoves[i] = min(minAmoves[i], minAmoves[i - 1])
    ans = N
    for i in range(LenA, N - LenB + 1):
        count = 0
        for d in range(LenB):
            if S[i + d] != B[d]:
                count += 1
        ans = min(ans, count + minAmoves[i - LenA])

    return ans

T = int(input())
S = [input() for i in range(T)]
for s in S:
    print(solve(s))