#define _USE_MATH_DEFINES #include <iostream> #include <iomanip> #include <algorithm> #include <cmath> #include <string> #include <list> #include <queue> #include <vector> #include <complex> #include <set> ///////// #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define P(p) cout<<(p)<<endl; ///////// typedef long long LL; typedef long double LD; ///////// using namespace::std; ///////// int cha(string str,int top,int end,string word){ if( end-top+1 < word.size() ){ return -1; } int ans = -1; int tans = 0; for(int i=top;i<= end-word.size()+1;++i){ tans = 0; for(int k=0;k<word.size();++k){ if(str[i+k] != word[k]){ ++tans; } } if(ans == -1 || ans > tans){ ans = tans; } } return ans; } int main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;// //cout << setprecision(6);// int T; cin>>T; string str[100]; rep(i,T){ cin>>str[i]; } int ans; int A,B; rep(i,T){ ans = -1; A = 0; B = 0; //int cha(string str,int top,int end,string word){ //good 4 //problem 7 for(int k=4;str[i].size()-k>=7;++k){ A = cha(str[i],0,k-1,"good"); B = cha(str[i],k,str[i].size()-1,"problem"); if( A != -1 && B != -1){ if(ans == -1 || ans > A+B){ ans = A+B; } } } P(ans); } return 0; }