T = int(input())
S = [input() for i in range(T)]
good = 'good'
good_len = len(good)
problem = 'problem'
problem_len = len(problem)
for t in range(T):
	N = len(S[t])
	ans = 10**9+7

	for i in range(0,N-good_len-problem_len+1):
		good_cnt = 0
		for j in range(good_len):
			if S[t][i+j] != good[j]: 
				good_cnt+=1
		for j in range(i+good_len,N-problem_len+1):
			cnt = 0
			#print(S[t][i:i+good_len],S[t][j:j+problem_len])
			for k in range(problem_len):
				if S[t][j+k] != problem[k]:
					cnt+=1
			ans = min(ans,good_cnt + cnt)
	print(ans)