Palindrome is a string that reads the same forwards and backwards.
Your task is to write a program that takes a set of uppercase Latin letters (which may include duplicates) and rearranges them, possibly deleting some, to form the longest possible palindrome. If there are multiple palindromes of the same maximum length, you should output the one that comes first in alphabetical order.
The input consists of a single string containing up to 10^5 uppercase Latin characters, with no spaces. The string will contain at least one character.
Output the longest palindrome that can be formed, on a single line.
Example 1