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

int differ(string s,string t){
  int cnt = 0;
  for(int i=0;i<s.length();++i) if(s[i]!=t[i]) ++cnt;
  return cnt;
}
int solve(string s){
  int tbl1[105] = {};
  int tbl2[105] = {};
  int n = s.length();
  for(int i=0;i<n;++i){
    if(i<3) tbl1[i] = 10;
    else{
      string sub = s.substr(i-3,4);
      tbl1[i] = min(tbl1[i-1],differ(sub,"good"));
    }
  }
  for(int i=n-1;i>=0;--i){
    if(i>n-7) tbl2[i] = 10;
    else{
      string sub = s.substr(i,7);
      tbl2[i] = min(tbl2[i+1],differ(sub,"problem"));
    }
  }

  int ret = n;
  for(int i=3;i<n-7;++i) ret = min(ret,tbl1[i]+tbl2[i+1]);
  return ret;
}

int main(){
  int t;
  cin >> t;
  while(t--){
    string s;
    cin >> s;
    cout << solve(s) << endl;
  }

  return 0;
}