#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;
const int INF=1e5;
int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int T;
  cin>>T;
  while(T--){
    string str,gd="good",prb="problem";
    cin>>str;
    int n=str.size();
    vector<int> gcost(n,INF),pcost(n,INF);
    rep(i,n-3){
      gcost[i]=0;
      rep(j,4) gcost[i]+=str[i+j]!=gd[j];
    }
    rep(i,n-6){
      pcost[i]=0;
      rep(j,7) pcost[i]+=str[i+j]!=prb[j];
    }
    vector<int> mn(n);
    mn[0]=gcost[0];
    rep(i,n-1)
      mn[i+1]=min(mn[i],gcost[i+1]);
    //cout<<gcost<<pcost<<mn;
    int re=INF;
    for(int i=4;i<n-6;++i)
      re=min(re,mn[i-4]+pcost[i]);
    cout<<re<<endl;
  }
  return 0;
}