#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;



int main() {
  string g="good",p="problem";
  int n;
  cin >> n;
  rep(i,n) {
    string s;
    cin >> s;
    int ans=MAX;
    rep(i,s.size()-10) {
      int cnt=0;
      REP(j,i,i+4) if(s[j]!=g[j-i]) cnt++;
      int c=MAX;
      REP(k,i+4,s.size()-6) {
	int cnt2=0;
	REP(j,k,k+7) if(s[j]!=p[j-k]) cnt2++;
	c=min(c,cnt2);
      }
      ans=min(ans,cnt+c);
    }
    cout << ans << endl;
  }
  return 0;
}