import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable INF = 10^^9;

int getCost(in string a, in string b) {
  assert(a.length == b.length);
  const len = cast(int)(a.length);
  int ret;
  foreach (i; 0 .. len) {
    if (a[i] != b[i]) {
      ++ret;
    }
  }
  return ret;
}

int N;
string S;

void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        S = readToken();
        N = cast(int)(S.length);
        
        auto headCount = new int[N + 1];
        foreach (i; 0 .. N) {
          headCount[i + 1] = headCount[i];
          if (i + 1 - 7 >= 0) {
            if (S[i + 1 - 7 .. i + 1] == "problem") {
              ++headCount[i + 1];
            }
          }
        }
        auto tailCost = new int[N + 1];
        tailCost[N] = INF;
        foreach_reverse (i; 0 .. N) {
          tailCost[i] = tailCost[i + 1];
          if (i + 7 <= N) {
            chmin(tailCost[i], getCost(S[i .. i + 7], "problem"));
          }
        }
        
        int ans = INF;
        foreach (i; 0 .. N) {
          if (i + 4 <= N) {
            int cost;
            cost += getCost(S[i .. i + 4], "good");
            cost += headCount[i];
            cost += tailCost[i + 4];
            chmin(ans, cost);
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}