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

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD (int)(1e9+7)

typedef long long ll;

int mindif[1000000];

int main(void) {
    int t;
    cin >> t;
    string good = "good";
    string problem = "problem";
    while (t--) {
        int i, j;
        string s;
        cin >> s;
        REP (i,0,s.size()-11) {
            mindif[i] = 0;
            rep (j,4) if (s[i+j] != good[j]) mindif[i]++;
            if (i > 0)
                mindif[i] = min(mindif[i-1],mindif[i]);
        }
        int ans = 11;
        int rm = 0;
        REP (i,0,s.size()-7) {
            int cnt = 0;
            rep (j,7) if (s[i+j] != problem[j]) cnt++;
            if (i >= 4) {
                if (rm > 0 && mindif[i-4] == 3)
                    ans = min(ans,cnt+rm+2);
                else
                    ans = min(ans,mindif[i-4]+cnt+rm);
            }
            if (cnt == 0)
                rm++;
        }
        cout << ans << endl;
    }
    return 0;
}