T = int(input())

def dist(a, b):
    cnt = 0
    assert len(a) == len(b)
    for i in range(len(a)):
        if a[i] != b[i]:
            cnt += 1
    return cnt

good, problem = "good", "problem"
INF = 1001001001
for _ in range(T):
    S = input()
    ans = INF
    for k in range(len(S)-9):
        for j in range(k+4, len(S)-6):
            ans = min(ans, dist(S[k:k+4], good) + dist(S[j:j+7], problem))
    print(ans)