def solve():
    S = input()
    N = len(S)
    M = 'goodproblem'
    ans = N
    for i in range(N-7):
        for j in range(i+4,N-6):
            X = S[i:i+4] + S[j:j+7]
            cnt = 0
            for k in range(11):
                if X[k] != M[k]:
                    cnt += 1
            ans = min(ans, cnt)
    print(ans)

T = int(input())
for _ in range(T):
    solve()