#include #include #include using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for(int i=0;i<(n);i++) #define Inf 1000000001 int get(string x,string y){ if(x.size()!=y.size())return Inf; int ret= 0; rep(i,x.size()){ if(x[i]!=y[i])ret++; } return ret; } int main(){ int _t; cin>>_t; rep(_,_t){ string s; cin>>s; int n = s.size(); vector dp(n+1,vector(2,Inf)); dp[0][0] = 0; int ans = Inf; rep(i,n){ { int cc = 0; if(s.substr(i,7)=="problem")cc = 1; dp[i+1][0] = min(dp[i+1][0],dp[i][0]+cc); } if(i+4<=n){ dp[i+4][1] = min(dp[i+4][1], dp[i][0] + get(s.substr(i,4), "good")); } dp[i+1][1] = min(dp[i+1][1],dp[i][1]); ans = min(ans,dp[i][1] + get(s.substr(i,7), "problem")); } cout<