#include <bits/stdc++.h>

using namespace std;


vector<int> doit(const string &s, const string &t) {
  int n = s.length();
  vector<int> ret(n, 1000000);
  for (int i = 0; i + t.length() <= s.length(); i++) {
    ret[i] = 0;
    for (int j = 0; j < t.length(); j++) {
      if (s[i+j] != t[j])
        ret[i]++;
    }
  }
  return ret;
}

void solve() {
  string s;
  cin >> s;

  vector<int> x = doit(s, "good");
  vector<int> y = doit(s, "problem");
  
  int n = s.length();
  int ret = 1000000;
  for (int i = n-2; i >= 0; i--)
    y[i] = min(y[i], y[i+1]);

  int p = 0;
  for (int i = 0; i + 4 < n; i++) {
    if (i >= 7 && s.substr(i-7, 7) == "problem")
      ++p;
    ret = min(ret, x[i] + y[i+4] + p);
  }

  cout << ret << endl;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int T;
  cin >> T;
  for (int t = 0; t < T; t++)
    solve();
   
  return 0;
}