CESTA

문제

One morning, completely by chance, Mirko found a positive integer N in the middle of the street. Since Mirko adores the number 30, he wants to know the maximum multiple of the number 30 that can be obtained by shuffling the digits of the number he found in the street.

Help our hero and write a programme that calculates that number (if it exists).

입력

The first and only line of input contains the integer N, consisting of at most 10⁵ digits.

출력

The first and only line of output must contain the required number from the task, if it exists. If it doesn’t exist, output -1.