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

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define SQR(X) ((X)*(X))

typedef long long ll;
typedef unsigned long long ull;
typedef long double lb;
/* ここからが本編 */
int str_cnt(char s1[],char s2[])
{
  int cnt = 0;
  int i,j;
  for(i=0;s2[i];i++) {
    if(s1[i] == s2[i]) cnt++;
  }
  return cnt;
}
int main(void)
{
  int i,j,k;
  int n,m;
  char s[105];
  int process[100];
  int good[100];
  int problem[100];
  cin  >> n;
  rep(i,n) {
    int cnt = 0;
    cin >> s;
    m = strlen(s);
    for(j=0;j+3 <= m;j++) {
      good[j] = str_cnt(s+j,"good");
    }
    for(j=0;j+7 <= m;j++) {
      problem[j] = str_cnt(s+j,"problem");
    }
    for(j=0;j+3 <= m;j++) {
      for(k = j+4; k+7 <= m; k++) {
        if(good[j] + problem[k] > cnt) {
          cnt = good[j] + problem[k];
        }
      }
    }
    process[i] = 11-cnt;
  }
  rep(i,n) {
    cout << process[i] << endl;
  }
  return 0;
}