레이팅 미적용설명
\(4^{th}\) round, December \(20^{th}\), 2014
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^{5}\) 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.
SAMPLE TEST DATA
input
input
input
30
102
2931
output
output
output
30
210
-1
예제 1
입력
30
출력
30
예제 2
입력
102
출력
210
예제 3
입력
2931
출력
-1
문제 정보