#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<utility>
#include <fstream>
#include<set>
#include<map>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;


#define RALL(x) (x).rbegin(),(x).rend()
#define ALL(x) (x).begin(),(x).end()
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,sizeof(a))

typedef pair<int,int> P;
typedef vector<pair<int,string> > pii;
typedef map<string,int> mdi;


int main() {
    int T; cin >> T;
    while (T--) {
        string S; cin >> S;
        int n = S.length();
        int mini = 1e9;
        for (int i = 0; i + 4 <= n; i++)
            for (int j = i + 4; j + 7 <= n; j++) {
                int cnt = 0;

                if (S[i + 0] != 'g') cnt++;
                if (S[i + 1] != 'o') cnt++;
                if (S[i + 2] != 'o') cnt++;
                if (S[i + 3] != 'd') cnt++;

                if (S[j + 0] != 'p') cnt++;
                if (S[j + 1] != 'r') cnt++;
                if (S[j + 2] != 'o') cnt++;
                if (S[j + 3] != 'b') cnt++;
                if (S[j + 4] != 'l') cnt++;
                if (S[j + 5] != 'e') cnt++;
                if (S[j + 6] != 'm') cnt++;

                mini = min(mini, cnt);
            }
        cout << mini << endl;
    }
}