#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

using namespace std;
typedef long long ll;

const int goodNumber = 4;
const int problemNumber = 7;

int solve(const string &s) {
    int ret = 1000;
    int n = s.size();
    for (int i = 0; i < n; i++) {
        for (int j = i+goodNumber; j <= n-problemNumber; j++) {
            int val = 0;
            if (s[i] != 'g') val++;
            if (s[i+1] != 'o') val++;
            if (s[i+2] != 'o') val++;
            if (s[i+3] != 'd') val++;
            if (s[j] != 'p') val++;
            if (s[j+1] != 'r') val++;
            if (s[j+2] != 'o') val++;
            if (s[j+3] != 'b') val++;
            if (s[j+4] != 'l') val++;
            if (s[j+5] != 'e') val++;
            if (s[j+6] != 'm') val++;
            ret = min(ret, val);
        }
    }
    return ret;
}

int main(void) {
    int T;
    cin >> T;
    while (T--) {
        string s;
        cin >> s;
        cout << solve(s) << endl;
    }
    return 0;
}