import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static int problem_dfs(int start, char[] input){
		final char[] problem = "problem".toCharArray();
		
		int min = problem.length;
		for(int i = start; i <= input.length - problem.length; i++){
			int count = 0;
			
			for(int j = 0; j < problem.length; j++){
				if(input[i + j] != problem[j]){
					count++;
				}
			}
			
			min = Math.min(min, count);
		}
		
		return min;
	}
	
	public static int good_dfs(char[] input){
		final char[] good = "good".toCharArray();
		
		int min = "goodproblem".length();
		for(int i = 0; i <= input.length - "goodproblem".length(); i++){
			int count = 0;
			
			for(int j = 0; j < good.length; j++){
				if(input[i + j] != good[j]){
					count++;
				}
			}
			
			min = Math.min(min, count + problem_dfs(i + good.length, input));
		}
		
		return min;
	}
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int T = sc.nextInt();
		
		for(int i = 0; i < T; i++){
			final char[] input = sc.next().toCharArray();
			
			System.out.println(good_dfs(input));
		}
	}
	
}