#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define minus(c) memset(c, -1, sizeof c)

typedef long long ll;
int const inf = 1<<29;

int main() {

  int T; cin >> T;

  rep(_, T) {
    string S; cin >> S;
    int dp1[110];  // S[i]までのgoodの最小置換数
    rep(i, 110) dp1[i] = inf;
    rep(i, S.size()-3) {
      int cnt = 0;
      rep(j, 4) {
        cnt += S[i+j] != "good"[j];
      }
      dp1[i+3] = min({dp1[i], dp1[i+1], dp1[i+2], cnt});
    }

    int ans = inf;
    rep(i, S.size()) {
      if(dp1[i] < inf) {
        REP(j, i+1, S.size()-6) {
          int cnt = 0;
          rep(k, 7) {
//            assert(j+k >= S.size());
            cnt += "problem"[k] != S[j+k];
          }
          ans = min(ans, dp1[i] + cnt);
        }
      }
    }

    cout << ans << endl;

  }

  return 0;
}