#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int len = s.length();
    string good = "good";
    string problem = "problem";
    int ans = 1111;
    for (int i = 0; i + 10 <= len - 1; i++) {
      int g = 0;
      FOR (k,0,4) {
        if (s[k+i] != good[k]) g++;
      }
      for (int j = i + 4; j + 6 <= len - 1; j++) {
        int p = 0;
        FOR (k,0,7) {
          if (s[k+j] != problem[k]) p++;
        }
        ans = min(ans, g + p);
      }
    }
    cout << ans << endl;
  }
  return 0;
}