#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int t;
string s[110];

int calc(string u) {
    const string good = "good";
    const string problem = "problem";
    int l = u.size();
    int res = inf, c0, c1;
    for (int i = 0; i < l; i++) {
        c0 = 0;
        for (int j = i; j < i+4; j++)
            if (u[j] != good[j-i])
                c0++;
        for (int j = i+4; j < l-6; j++) {
            c1 = 0;
            for (int k = j; k < j+7; k++)
                if (u[k] != problem[k-j])
                    c1++;
            res = min(res, c0+c1);
        }
    }
    return res;
}

void solve() {
    for (int i = 0; i < t; i++) {
        cout << calc(s[i]) << endl;
    }
}

void input() {
    cin >> t;
    for (int i = 0; i < t; i++) cin >> s[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    solve();
}