#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <ctime>
#include <cstdlib>
#include <fstream>
#include <string>
#include <sstream>
#include <map>
#include <cmath>
#define LL long long
#define lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const int MAXN = 1000 + 5;
 
typedef pair<int, int> pii;
typedef vector<int>::iterator viti;
typedef vector<pii>::iterator vitii;
 
int dp[MAXN];
char str[MAXN];
 
bool Check(int l, int r)
{
    while (l < r)
    {
        if (str[l] != str[r]) return false;
        l++; r--;
    }
    return true;
}
 
int main()
{
    //ROP;
    int T, i, j;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%s", str + 1);
        int len = strlen(str + 1);
        for (i = 1; i <= len; i++)
        {
            dp[i] = dp[i - 1] + 1;
            for (j = 1; j < i; j++)
                if (Check(j, i)) dp[i] = min(dp[j - 1] + 1, dp[i]);
        }
        printf("%d\n", dp[len]);
    }
    return 0;
}