#include <iostream>
#include <vector>
#include <string>
using namespace std;
string now;
int cache[1000];

int value(int start, int end)
{
    string tmp = now.substr(start,end);
    if(tmp == string(tmp.size(),tmp[0]))
    {
        return 1;
    }
    for(int i=1;i+1<=tmp.size();i++)
    {
        if(tmp[i] - tmp[i-1] == tmp[i+1] - tmp[i])
        {
            if((tmp[i]-tmp[i-1] == 1 && tmp[i+1]-tmp[i] == 1) || (tmp[i]-tmp[i-1] == -1 && tmp[i+1]-tmp[i] == -1))
            {
                return 2;
            }
            else
            {
                return 5;
            }
        }
    }
    int no3=true;
    for(int i = 0; i<tmp.size();i++)
    {
        if(tmp[i] != tmp[i%2])
            no3 = false;
    }
    if(no3 ==true)
    {
        return 4;
    }
    return 10;

}
int divide(int start)
{
    if(start == now.size())
        return 0;
    int& ret = cache[start];
    if(ret != -1) return ret;
    ret=99999999;
    for(int there = 3; there < 6; there++)
    {
        if(there+start <= now.size())
        {
            ret = min(ret,divide(there+start) + value(start,there+start));
        }
    }
    return ret;
}
int main()
{
    vector<string> arr;
    int howmuch;
    string s;
    cin >> howmuch;

    while(howmuch--)
    {
        cin >> s;
        arr.push_back(s);
    }
    //cout << arr[1] << endl;
    for(int i=0;i<arr.size();i++)
    {
        memset(cache,-1,sizeof(cache));
        now = arr[i];
        int result = divide(0);
        printf("%d\n",result);
        result=0;
    }

}