#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std; using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

constexpr int INF = LIM<>::max() / 2;

const VS targets( { "good", "problem" } );

int match( const string &S, const int p, const string &T )
{
	const int L = SZ( T );

	int res = 0;
	REP( i, L )
	{
		res += S[ p + i ] != T[i];
	}
	return res;
}

char buf[ 1 << 20 ];
int dp[ 1 << 20 ][3];

int solve()
{
	string S;
	{
		gets( buf );
		S = string( buf );
	}

	const int L = SZ( S );

	fill( AALL( dp, int ), INF );
	dp[0][0] = 0;
	REP( i, L )
	{
		REP( j, 3 )
		{
			dp[ i + 1 ][j] = min( dp[ i + 1 ][j], dp[i][j] + ( j == 0 && i + SZ( targets[1] ) <= L && match( S, i, targets[1] ) == 0 ) );

			if ( j < 2 && i + SZ( targets[j] ) <= L )
			{
				const int L2 = SZ( targets[j] );
				dp[ i + L2 ][ j + 1 ] = min( dp[ i + L2 ][ j + 1 ], dp[i][j] + match( S, i, targets[j] ) );
			}
		}
	}

	return dp[L][2];
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int T;
// 	cin >> T;
	scanf( "%d ", &T );

	REP( i, T )
	{
// 		cout << solve() << endl;
		printf( "%d\n", solve() );
	}

	return 0;
}