#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const char* good = "good";
const char* problem = "problem";

int main(void) {
  int T;
  char s[111];
  scanf("%d", &T);
  for (int iii = 0; iii < T; iii++) {
    scanf("%s", s);
    int l = strlen(s);
    int res = 111111;
    for (int i = 0; i <= l-4; i++) {
      int c = 0;
      for (int j = 0; j < 4; j++) {
        if (s[i+j] != good[j]) ++c;
      }
      for (int j = i+4; j <= l-7; j++) {
        int c2 = 0;
        for (int k = 0; k < 7; k++) {
          if (s[j+k] != problem[k]) ++c2;
        }
        res = min(res, c+c2);
      }
    }
    printf("%d\n", res);
  }
  return 0;
}