import java.util.Scanner;

public class Main {
	
	static final String GOOD_STRING = "good";
	static final String PROBLEM_STRING = "problem";
	static int mAns = Integer.MAX_VALUE;
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		for(int i=0; i<N; i++) {
			mAns = Integer.MAX_VALUE;
			String T = sc.next();
			serch(T);
			System.out.println(mAns);
		}
	}
	
	private static void serch(String str) {
		
		String base = GOOD_STRING;
		
		//good
		for(int i=0; i<=str.length()-base.length(); i++) {
			
			String target = str.substring(i, base.length()+i);
			int n_good = unmatchCharacterNum(target, base);
			
			String nextStr = str.substring( base.length()+i);
						
			//problem
			String nextBase = PROBLEM_STRING;
									
			for(int j=0; j<=nextStr.length()-nextBase.length(); j++) {
				
				String nextTarget = nextStr.substring(j, nextBase.length()+j);
				int n_problem = unmatchCharacterNum(nextTarget, nextBase);
				
				mAns = Math.min(mAns, n_good+n_problem);
			}
		}
	}
	
	//一致していない文字の個数を返す。
	private static int unmatchCharacterNum(String target, String base) {
		if(target.equals(base)) {
			return 0;
		}
		if(target.length() != base.length()) {
			throw new IllegalArgumentException("length is bad");
		}
		int count = 0;
		for(int i=0; i<target.length(); i++) {
			if(target.charAt(i) != base.charAt(i)) count++;
		}
		return count;
	}
}