#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <string>

 #include <vector>

 #include <map>

 #include <set>

 #include <queue>

 #include <sstream>

 #include <algorithm>

 using namespace std;

 #define pb push_back

 #define mp make_pair

 #define ms(a, b)  memset((a), (b), sizeof(a))

 #define eps 0.0000001

 typedef long long LL;

 const int INF = 2e9;

 const LL LNF = 9e18;

 const int mod = 1e9+;

 const int maxn = +;

 char s[maxn];

 int dp[maxn][maxn];

 void solve()

 {

     scanf("%s",s);

     int len = strlen(s);

     for(int i = ; i<len; i++)

     {

         for(int j = ; j<len; j++)

         {

             if(s[i]==s[len--j])

                 dp[i+][j+] = dp[i][j] + ;

             else

                 dp[i+][j+] = max(dp[i][j+],dp[i+][j]);

         }

     }

     printf("%d\n", len-dp[len][len]);

 }

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--){

         ms(dp,);

         solve();

     }

 }