#include<iostream>
#include<cstring>
using namespace std;
 
 
string a;
int n;
 
 
int solve(int i, int j, int moves)
{
	if(i>=j)
		return  moves;
 
 
 
	if(a[i]==a[j])
		return  solve(i+1, j-1, moves);
	else
		return  min(min(solve(i+1, j-1, moves+1), solve(i+1, j, moves+1)), solve(i, j-1, moves+1));
}
 
 
 
 
int main()
{
	int T;
	cin >> T;
	while(T--)
	{
		cin >> a;
		n = a.length();
 
 
		int ans = solve(0, n-1, 0);
 
		cout << ans << "\n";
	}
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGNzdHJpbmc+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKIApzdHJpbmcgYTsKaW50IG47CgogCmludCBzb2x2ZShpbnQgaSwgaW50IGosIGludCBtb3ZlcykKewoJaWYoaT49aikKCQlyZXR1cm4gIG1vdmVzOwoJCgkKCQoJaWYoYVtpXT09YVtqXSkKCQlyZXR1cm4gIHNvbHZlKGkrMSwgai0xLCBtb3Zlcyk7CgllbHNlCgkJcmV0dXJuICBtaW4obWluKHNvbHZlKGkrMSwgai0xLCBtb3ZlcysxKSwgc29sdmUoaSsxLCBqLCBtb3ZlcysxKSksIHNvbHZlKGksIGotMSwgbW92ZXMrMSkpOwp9CiAKIAogCiAKaW50IG1haW4oKQp7CglpbnQgVDsKCWNpbiA+PiBUOwoJd2hpbGUoVC0tKQoJewoJCWNpbiA+PiBhOwoJCW4gPSBhLmxlbmd0aCgpOwoJCQogCgkJaW50IGFucyA9IHNvbHZlKDAsIG4tMSwgMCk7CiAKCQljb3V0IDw8IGFucyA8PCAiXG4iOwoJfQp9

Ngp0YW5iaXJhaG1lZApzaGFocmlhcm1hbnpvb3IKbW9uaXJ1bGhhc2FuCnN5ZWRtb25vd2FyaG9zc2FpbgpzYWRydWxoYWJpYmNob3dkaHVyeQptb2hhbW1hZHNhamphZGhvc3NhaW4=

6
tanbirahmed
shahriarmanzoor
monirulhasan
syedmonowarhossain
sadrulhabibchowdhury
mohammadsajjadhossain