import sys
input = sys.stdin.readline

class SegmentTree:
    def __init__(self, size, f=min, default=10 ** 18):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res

M = int(input())
for _ in range(M):
    S = list(input())
    N = len(S)
    T = SegmentTree(N)
    problem = "problem"
    for i in range(N - 7):
        cnt = 0
        for j in range(7):
            cnt += int(S[i + j] != problem[j])
        T.update(i, cnt)
        
    ans = 10 ** 18
    good = "good"
    problem_cnt = 0
    for i in range(N - 4):
        cnt = problem_cnt
        for j in range(4):
            cnt += int(S[i + j] != good[j])
        ans = min(ans, cnt + T.query(i + 4, N))
        if i >= 6:
            if S[i-6:i+1] == list(problem):
                problem_cnt += 1

    print(ans)