import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.set_int_max_str_digits(10 ** 6)
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def check(s, t):
    return sum(ss != tt for ss, tt in zip(s, t))


def main():
    T = NI()
    for _ in range(T):
        S = SI()
        N = len(S)
        dpg = [11] * (N+1)
        dpp = [11] * (N+1)
        for i in range(4, N+1):
            dpg[i] = min(dpg[i-1], check(S[i-4:i], "good"))
        for i in range(N-7, -1, -1):
            dpp[i] = min(dpp[i+1], check(S[i:i+7], "problem"))
        ans = 11
        # print(dpg, dpp)
        ig = S.find("good")
        ip = S.find("problem")
        # print(ig, ip)
        if ig == -1:
            ig = N
        if ip == -1:
            ip = N
        ig += 4
        for i, (x, y) in enumerate(zip(dpg, dpp)):
            # print(i, x, y, ig, ip, ig<i, ip<i)
            ans = min(ans, x+y + int(ig < i) + int(ip < i))
        print(ans)


if __name__ == "__main__":
    main()