#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	int T;
	cin>>T;
	rep(i,T){
		string s;
		cin>>s;
		vint dp1(s.size(),INF);
		vint dp2(s.size(),INF);
		vint dp3(s.size(),INF);
		rep(j,s.size()-6){
			dp3[j]=0;
			if(s.substr(j,7)=="problem") dp3[j]++;
			if(j) dp3[j]+=dp3[j-1];
			// cout<<j<<" "<<dp3[j]<<endl;
		}
		reep(j,3,s.size()){
			dp1[j]=0;
			rep(k,4){
				if(s[j-k]!="good"[3-k]) dp1[j]++;
			}
			if(j-10>=0) dp1[j]+=dp3[j-10];
		}
		rep(j,s.size()-6){
			dp2[j]=0;
			rep(k,7){
				if(s[j+k]!="problem"[k]) dp2[j]++;
			}
		}
		vint sum1(s.size(),INF);
		rep(i,s.size()){
			if(!i) sum1[i]=dp1[i];
			else sum1[i]=min(sum1[i-1],dp1[i]);
		}
		int ans=INF;
		reep(i,4,s.size()-6){
			ans=min(ans,dp2[i]+sum1[i-1]);
		}
		cout<<ans<<endl;
	}
}


signed main() {
	ios_base::sync_with_stdio(false);
  	cout<<fixed<<setprecision(20);
    mainmain();
}