def solve(s):
    n = len(s)
    g = [11]*(n-3)
    p = [11]*(n-6)
    for i in range(n-3):
        g[i] = sum(x != y for x,y in zip("good",s[i:i+4]))
    for i in range(n-6):
        p[i] = sum(x != y for x,y in zip("problem",s[i:i+7]))
    q = p[:]
    for i in range(1,n-6):
        q[i] = min(q[i],q[i-1])
    for i in range(n-8,-1,-1):
        p[i] = min(p[i],p[i+1])
    ans = 11
    for i in range(n-10):
        ans = min(ans,g[i]+p[i+4] + (1 if i >= 7 and q[i-7]==0 else 0))
    return ans

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