#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int T;
    cin >> T;
    string g = "good";
    string p = "problem";
    vector<string> S(T);
    vector<int> G(101),P(101);
    for ( int i = 0; i < T; i++ ) {
        cin >> S[i];
    }
    for ( int i = 0; i < T; i++ ) {
        for ( int j = 0; j <= S[i].length()-4; j++ ) {
            string s = S[i].substr(j,4);
            int a = 0;
            for ( int k = 0; k < 4; k++ ) {
                if ( s[k] != g[k] ) { a++; }
            }
            G[j] = a;
        }
        for ( int j = 0; j <= S[i].length()-7; j++ ) {
            string s = S[i].substr(j,7);
            int a = 0;
            for ( int k = 0; k < 7; k++ ) {
                if ( s[k] != p[k] ) { a++; }
            }
            P[j] = a;
        }
        int a = INT_MAX;
        for ( int j = S[i].length()-7; j >= 0; j-- ) {
            a = min( a, P[j] );
            P[j] = a;
        }

        int ans = INT_MAX;
        for ( int j = 0; j <= S[i].length()-11; j++ ) {
            ans = min( ans, G[j] + P[j+4] );
        }
        cout << ans << endl;

    }

    return 0;
}