#include <iostream>

#include <cstdio>

#include <cstring>

using namespace std;

char S[];

int dp[][];

int width(int x){

    int l = ;

    while(x) { l++; x /= ; }

    return l;

}

int dfs(int i, int j){

    if(i > j) return ;

    if(dp[i][j] < ) return dp[i][j];

    int L = j-i+;

    if(L == ) return ;

    dp[i][j] = L;

    for(int c = i; c < j; c++) dp[i][j] = min(dp[i][j], dfs(i, c) + dfs(c+, j));

    for(int k = ; k <= L; k++){

        if(L % k != ) continue;

        int l = L/k, f = ;

        for(int t = ; t < k- && !f; t++){

            for(int c = ; c < l && !f; c++)

                if(S[i+l*t+c] != S[i+l*(t+)+c]) f = ;

        }

        if(!f) dp[i][j] = min(dp[i][j], width(k)++dfs(i, i+l-));

    }

    return dp[i][j];

}

int main()

{

    int T;

    cin>>T;

    while(T--){

        cin>>S;

        int n = strlen(S);

        memset(dp, , sizeof(dp));

        cout<<dfs(, n-)<<endl;

    }

    return ;

}