#include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const string temp[] = {"good", "problem"};
int unmatch[2][1000000];


int main()
{ 
  int K;
  cin >> K;
  while(K--) {
    string S;
    cin >> S;
    for(int j = 0; j < 2; j++) {
      for(int i = 0; i <= S.size() - temp[j].size(); i++) {
        unmatch[j][i] = 0;
        for(int k = 0; k < temp[j].size(); k++) {
          unmatch[j][i] += S[i + k] != temp[j][k];
        }
      }
    }
    for(int i = 1; i <= S.size() - temp[0].size(); i++) {
      unmatch[0][i] = min(unmatch[0][i - 1], unmatch[0][i]);
    }
    int add = 0;
    for(int i = S.size() - temp[1].size() - 1; i >= 0; i--) {
      bool flag = false;
      if(unmatch[1][i] == 0) ++flag;
      unmatch[1][i] = min(unmatch[1][i + 1], unmatch[1][i] + add);
      add += flag;
    }
    
    int ret = INF;
    for(int i = 0; i + temp[0].size() <= S.size() - temp[1].size() ; i++) {
      ret = min(ret, unmatch[0][i] + unmatch[1][i + temp[0].size()] + add);
    }
    cout << ret << endl;
  }

}