#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
string g="good",p="problem";
void solve(){
  string s;cin >> s;
  set<ll> ex;
  rep(i,s.size()-7){
    if(s.substr(i,7)==p)ex.insert(i);
  }
  ll cost=0;
  vl pre(s.size(),INF);
  rep(i,s.size()-3){
    pre[i]=cost;
    rep(j,4){
      if(s[i+j]!=g[j])pre[i]++;
    }
    if(ex.count(i-6))cost++;
  }
  vl post(s.size(),INF);
  for(int i=4;i<=s.size()-7;i++){
    post[i]=0;
    rep(j,7){
      if(s[i+j]!=p[j])post[i]++;
    }
  }
  per(i,s.size()-1)chmin(post[i],post[i+1]);
  //rep(i,s.size())cout <<pre[i] <<" ";cout << endl;
  //rep(i,s.size())cout <<post[i] <<" ";cout << endl;
  ll ans=INF;
  rep(i,s.size()-4){
    chmin(ans,pre[i]+post[i+4]);
  }
  cout << ans <<endl;
}

int main(){
  ll n;cin >> n;
  while(n--)solve();
}