using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static string InputPattern = "Input5";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("3");
            WillReturn.Add("veryverygoodproblem");
            WillReturn.Add("goodexcellentproblems");
            WillReturn.Add("problemgood");
            //0
            //0
            //10
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("2");
            WillReturn.Add("goodproblem");
            WillReturn.Add("agdddekproblemsdl");
            //0
            //2
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("9");
            WillReturn.Add("geodaaaproblem");
            WillReturn.Add("goodproblen");
            WillReturn.Add("badendlessprobrem");
            WillReturn.Add("podpdpprrobleem");
            WillReturn.Add("problemgoodprobremgood");
            WillReturn.Add("smallproblem");
            WillReturn.Add("proproprefurohobbyhobby");
            WillReturn.Add("gooeproblemd");
            WillReturn.Add("itisproblemcoolgoodproblem");
            //1
            //1
            //4
            //5
            //1
            //4
            //8
            //1
            //0
        }
        else if (InputPattern == "Input4") {
            WillReturn.Add("5");
            WillReturn.Add("problemgoodproblem");
            WillReturn.Add("problemproblem");
            WillReturn.Add("goodgoodgood");
            WillReturn.Add("xxxxxxxxxxxxx");
            WillReturn.Add("badendlessproblemactivetogood");
            //0
            //3
            //6
            //11
            //3
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();
        string[] SArr = InputList.Skip(1).ToArray();

        Array.ForEach(SArr, X => DeriveCost(X));
    }

    //GoodProblemに変換する際の最小コストを求める
    static void DeriveCost(string pBeforeStr)
    {
        //Goodに変換するコストの配列
        int[] CostGoodArr = DeriveNeedCostArr(pBeforeStr, "good");

        //Problemに変換するコストの配列
        int[] CostProblemArr = DeriveNeedCostArr(pBeforeStr, "problem");

        //Console.WriteLine("{0}のGoodへのコスト", pBeforeStr);
        //Array.ForEach(CostGoodArr, X => Console.Write(X));
        //Console.WriteLine();

        //Console.WriteLine("{0}のProblemへのコスト", pBeforeStr);
        //Array.ForEach(CostProblemArr, X => Console.Write(X));
        //Console.WriteLine();

        //最小のコスト合計を求める
        int Answer = int.MaxValue;
        for (int I = 0; I <= CostGoodArr.GetUpperBound(0); I++) {
            //下限値枝切り
            if (Answer < CostGoodArr[I]) continue;

            int StaInd = I + "good".Length;
            for (int J = StaInd; J <= CostProblemArr.GetUpperBound(0); J++) {
                int CostSum = CostGoodArr[I] + CostProblemArr[J];
                //Console.WriteLine("I={0},J={1},CostSum={2}", I, J, CostSum);
                if (Answer > CostSum) {
                    Answer = CostSum;
                }
            }
        }
        Console.WriteLine(Answer);
    }

    //指定文字列の各Indから指定文字列に変換する際のコストの配列を返す
    static int[] DeriveNeedCostArr(string pBeforeStr, string pNeedStr)
    {
        var WillReturnList = new List<int>();

        for (int I = 0; I <= pBeforeStr.Length - 1; I++) {
            if (I + pNeedStr.Length > pBeforeStr.Length)
                break;
            int Cnt = 0;
            for (int J = 0; J <= pNeedStr.Length - 1; J++) {
                if (pNeedStr[J] != pBeforeStr[I + J])
                    Cnt++;
            }
            WillReturnList.Add(Cnt);
        }
        return WillReturnList.ToArray();
    }
}