COCI '14 Contest 4 #1 Cesta

Points: 5 (partial)

Time limit: 1.0s

Memory limit: 32M

Problem type

One morning, completely by chance, Mirko found a positive integer $N$ $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).

Input

The first and only line of input contains the integer $N$ $N$ , consisting of at most $10^5$ $10^{5}$ digits.

Output

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 Input 1

Copy

Sample Output 1

Copy

Sample Input 2

Copy

Sample Output 2

Copy

Sample Input 3

Copy

Sample Output 3

Copy

-1

Comments

0

ross_cleary commented on May 29, 2020, 4:48 a.m.

This problem should also be tagged as greedy algorithms.

-2

LOLWHATOMGBBQ commented on May 19, 2015, 1:54 a.m. ← edited →

Why does this problem have partial points? There aren't really any corner cases or increase in difficulty.

2

omaewamoushindeiru commented on June 20, 2015, 5:25 a.m.

Maybe that some solutions TLE?

-1

kobortor commented on June 20, 2015, 2:28 p.m.

https://dmoj.ca/submission/98133