use std::cmp::min;

fn main() {
    let mut t = String::new();
    std::io::stdin().read_line(&mut t).ok();
    let t: usize = t.trim().parse().unwrap();

    const ANSWER_LEN: usize = 11;
    for _ in 0..t {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).ok();
        let s: &str = s.trim();
        let slen = s.len();
        let mut good: Vec<usize> = vec![ANSWER_LEN; slen];
        let mut problems: Vec<usize> = vec![ANSWER_LEN; slen];
        for i in 0..slen-3 {
            good[i] = s.chars()
                .skip(i)
                .take(4)
                .zip("good".chars())
                .filter(|pair| pair.0 != pair.1)
                .count()
                + 7
            ;
            if i > 0 {
                good[i] = min(good[i], good[i-1]);
            }
        }
        for i in (0..slen-6).rev() {
            problems[i] = s.chars()
                .skip(i)
                .take(7)
                .zip("problem".chars())
                .filter(|pair| pair.0 != pair.1)
                .count()
                + 4
            ;
            problems[i] = min(problems[i], problems[i+1]);
        }
        let mut result: usize = 11;
        for i in 0..slen-ANSWER_LEN+1 {
            result = min(result, good[i] + problems[i+4] - 11);
        }
        println!("{}", result);
    }
}