from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    def cnt_change(s, t):
        n = len(s)
        m = len(t)
        res = [inf] * n
        for i in range(n - m + 1):
            change = 0
            for c0, c1 in zip(s[i:], t):
                if c0 != c1: change += 1
            res[i] = change
        return res

    t = II()
    for _ in range(t):
        s = input()
        n = len(s)
        cg = cnt_change(s, "good")
        cp = cnt_change(s, "problem")
        #print(cg)
        #print(cp)
        mn = inf
        for i in range(n):
            if cg[i] < mn:
                mn = cg[i]
            else:
                cg[i] = mn
        mn = inf
        for i in range(n-1,-1,-1):
            if cp[i] < mn:
                mn = cp[i]
            else:
                cp[i] = mn
        #print(cg)
        #print(cp)
        ans=inf
        for i in range(n-6):
            val=cg[i]+cp[i+4]
            if val<ans:ans=val
        print(ans)


main()