def f(S, T):
    if len(S) < len(T):
        return 100
    cnt = 100
    for i in range(len(S) - len(T) + 1):
        v = 0
        for j in range(len(T)):
            if S[i + j] != T[j]:
                v += 1
        cnt = min(cnt, v)
    return cnt
        

T = int(input())
good = list("good")
problem = list("problem")
for _ in range(T):
    S = list(input())
    ans = 100
    for i in range(len(S)):
        ans = min(ans, f(S[:i], good) + f(S[i:], problem))
    print(ans)