Anti-Palindrome

Let n be the length of a string P. The string P is an anti-palindrome if, for every integer i with 0 <= i < floor(n/2), the characters P[i] and P[n-i-1] are different. If the length is odd, the middle character may be anything.

For instance, "c", "cpp", and "java" are anti-palindromes, while "test", "pp", and "weather" are not.

You are given a string S. Rearrange all characters of S exactly once to form an anti-palindrome. If there are multiple valid rearrangements, print the lexicographically smallest one.

The first line contains the string S. Its length is at most 50, and it consists only of lowercase English letters.

Print the lexicographically smallest rearrangement that satisfies the condition. If no such rearrangement exists, print -1.