#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)

#define INF 1e8

int diff(string s, string t) {
    int i, cnt = 0;
    rep (i,s.size()) {
        if (s[i] != t[i])
            cnt++;
    }
    return cnt;
}

int main() {
    int i, t;
    cin >> t;
    rep (i,t) {
        string s;
        int x, y, ans = INF;
        cin >> s;
        rep (x,s.size()-10) REP (y,x+4,s.size()-6) {
            int cnt = 0;
            string g = "good";
            string p = "problem";
            ans = min(ans,diff(s.substr(x,4),g)+diff(s.substr(y,7),p));
        }
        cout << ans << endl;
    }
    return 0;
}