XadillaX likes to play with strings very much.
His favorite string is palindrome. Once he come across with a string, XadillaX always wants to change it to a palindrome by resorting the letters.

Now give you a string, you should tell him whether the string can be changed to a palindrome. If yes, you should output it. (The smallest one in Lexicographic order)

This problem contains several cases.
Each case is a string, no longer than 20000. Only contains uppercase letters.

For each case, if it can be changed to a palindrome, output it. If can't, output 0.