t = gets.to_i
good = "good"
prob = "problem"
glen = good.length
plen = prob.length
t.times do
    str = gets.strip
    n = str.length - plen - glen + 1
    a = Array.new(n)
    max = 0
    n.times do |i|
        ac = 0
        glen.times do |j|
            ac += 1 if str[i + j] == good[j]
        end
        if ac > max
            max = ac
        end
        a[i] = max
    end
    max = 0
    n.times do |i|
        bc = 0
        plen.times do |j|
            bc += 1 if str[i + j + glen] == prob[j]
        end
        b = a[i] + bc
        if b > max
            max = b
        end
    end
    puts plen + glen - max
end