Your task is to reorder the characters of a string so that no two adjacent characters are the same. What is the lexicographically minimal such string?
The only line has a string of length $n$ consisting of characters A–Z.
Print the lexicographically minimal reordered string where no two adjacent characters are the same. If it is not possible to create such a string, print $-1$ .