#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np


# %%
T = int(readline())
S = np.array(list(read().rstrip()), dtype=np.int8)

# %%
G = np.zeros(len(S), dtype=np.int64)
P = np.zeros(len(S), dtype=np.int64)

for i, ch in enumerate(b'problem'):
    P[:-6] += (S[i: len(S) - 6 + i] != ch)

for i, ch in enumerate(b'good'):
    G[:-4] += (S[i: len(S) - 4 + i] != ch)

ind = np.where(S == ord('\n'))[0]
Ss = np.split(S, ind)
Gs = np.split(G, ind)
Ps = np.split(P, ind)


# %%
def solve(S, G, P):
    if S[0] == ord('\n'):
        S = S[1:]
        G = G[1:]
        P = P[1:]
    G[7:] += np.cumsum(P[:-7] == 0)
    G = np.minimum.accumulate(G[:-10])
    cost = G + P[4:-6]
    return cost.min()


for S, G, P in zip(Ss, Gs, Ps):
    print(solve(S, G, P))