#include<vector>
#include<map>
#include<climits>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<string>
#include<bitset>
#include<cstring>
#include<list>
#include<iterator>
using namespace std;
typedef vector<string>vs;
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef pair<int,int>pii;
typedef long long ll;
typedef pair<ll,ll>pll;
#define rrep(i,x,n) for(int i=(x);i<(n);++i)
#define rep(i,x) rrep(i,0,(x))
#define fi first
#define se second
#define each(i,c) for(typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
#define maxs(a,b) (a)=max(a,b)
#define mins(a,b) (a)=min(a,b)

const string g="good",p="problem";

int solve(string str){
    int gs[100]={0},ps[100]={0};

    rep(i,str.size()-3){
        string sub=str.substr(i,4);
        rep(j,4)if(sub[j]!=g[j])gs[i]++;
        if(i)mins(gs[i],gs[i-1]);
    }
    for(int i=str.size()-7;i>3;i--){
        string sub=str.substr(i,7);
        rep(j,7)if(sub[j]!=p[j])ps[i]++;
        if(i!=str.size()-7)mins(ps[i],ps[i+1]);
    }

    int mi=INT_MAX/4;

    rrep(i,4,str.size()-6)mins(mi,gs[i-4]+ps[i]);

    return mi;
}

int main(){
    int N;
    cin>>N;
    rep(_,N){
        string str;
        cin>>str;
        cout<<solve(str)<<endl;
    }


    return 0;
}