Given a string of lowercase letters. Find minimum characters to be inserted in string so that it can become palindrome. We can change positions of characters in string.
First line consists of T test cases. Only line consists of a String s.
Single line output, print the count of minimum characters to be inserted.
For the first test case:
geeksforgeeks can be changed as:
and many more For the second test case: It can form a palindrome without insertion of any element.