for _ in[0]*input():
	s=raw_input()
	g="good"
	p="problem"
	gn=[114514]*len(s)
	pn=[364364]*len(s)
	for i in range(len(s)-3):
		c=0
		for j in range(4):
			if g[j]!=s[i+j]:
				c+=1
		gn[i]=c
	for i in range(4,len(s)-6):
		c=0
		for j in range(7):
			if p[j]!=s[i+j]:
				c+=1
		pn[i]=c
	n=[]
	for i in range(len(s)-10):
		for j in range(i+4,len(s)-6):
			n+=[gn[i]+pn[j]]
	print min(n)