Time limit
Memory limit
Given a name written with uppercase English letters, rearrange all of its letters to make a palindrome.
If more than one palindrome can be made, output the lexicographically smallest one. If no palindrome can be made, output the required impossible string.
The first line contains the name. It consists only of uppercase English letters and has length at most 50.
Output the answer on one line. If it is impossible to rearrange the letters into a palindrome, output I'm Sorry Hansoo.