def check(s1, s2):
    c = 0
    for i in range(len(s1)):
        if s1[i] != s2[i]:
            c += 1
    return c

t = int(input())

for i in range(t):
    s = input()
    cost = 100
    for j in range(len(s)):
        for k in range(j+4,len(s)-6,1):
            cost = min(cost, check(s[j:j+4], 'good') + check(s[k:k+7], 'problem'))
    print(cost)