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

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int inf = 987654321;

int main(void) {
  int t; scanf("%d", &t);
  for(int cases : range(t)) {
    string s; cin >> s;
    int n = s.size();
    int res = inf;
    for(int i : range(n-3)) {
      for(int j : range(i+4, n-6)) {
        int tmp = (s[i]   != 'g') + 
                  (s[i+1] != 'o') +
                  (s[i+2] != 'o') +
                  (s[i+3] != 'd') +
                  (s[j]   != 'p') +
                  (s[j+1] != 'r') +
                  (s[j+2] != 'o') +
                  (s[j+3] != 'b') +
                  (s[j+4] != 'l') +
                  (s[j+5] != 'e') +
                  (s[j+6] != 'm');
        res = min(res, tmp);
      }
    }
    printf("%d\n", res);
  }
  return 0;
}