nyoj37 回文字符串

import java.util.Scanner;
public class Main 
{
	static int lcs(String str1,String str2)
	{
		int len1=str1.length();
		int len2=str2.length();
		int lc[][]=new int[len1+1][len2+1];
		for(int i=1;i<=len1;i++)
		{
			for(int j=1;j<=len2;j++)
			{
				if(str1.charAt(i-1)==str2.charAt(j-1))
				{
					lc[i][j]=lc[i-1][j-1]+1;
				}
				else 
				{
					lc[i][j]=Math.max(lc[i-1][j], lc[i][j-1]);
				}
			}
		}
		return lc[len1][len2];
	}
	public static void main(String[] args)
	{
		Scanner cin=new Scanner(System.in);
		int N=cin.nextInt();
		while(N--!=0)
		{
			String str1=cin.next();
			String str2=new StringBuffer(str1).reverse().toString();
			System.out.println(str1.length()-lcs(str1,str2));
		}
	}
}