#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 mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n;
  cin >> n;
  string g="good",p="problem";
  while(n--) {
    string s;
    cin >> s;
    int gc[5],pc[8],k=-1,k2=-1;
    memset(gc,-1,sizeof(gc));
    memset(pc,-1,sizeof(pc));
    rep(i,s.size()) {
      if(s.size()-i>=4) {
        int c=0;
        rep(j,4) {
          if(s[i+j]!=g[j]) c++;
        }
        if(gc[c]==-1) gc[c]=i;
        if(!c && k2!=-1) k=k2;
      }
      if(s.size()-i>=7) {
        int c=0;
        rep(j,7) {
          if(s[i+j]!=p[j]) c++;
        }
        pc[c]=i;
        if(!c && k2==-1) k2=i;
      }
    }
    int ans=MAX;
    rep(i,5) {
      rep(j,8) {
        if(gc[i]==-1 || pc[j]==-1) continue;
        if(gc[i]+3<pc[j]) {
          int d=i+j;
          if(k!=-1 && (k-gc[i]<0 || k-gc[i]>3)) d++;
          ans=min(ans,d);
        }
      }
    }
    pr(ans);
  }
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}