Description

Mirko found a positive integer $n$. Since Mirko likes the number $30$, he wants to know the largest multiple of $30$ among the numbers that can be formed using each digit of $n$.

Write a program to compute this number (if it does not exist, output -1).

Input Format

One number $n$.

Output Format

Only one line: the required number.

30

30

102

210

2931

-1

Hint

Constraints

For $100\%$ of the testdata, the number of digits of $n$ does not exceed $10^5$.

Notes

This problem is translated from COCI2014-2015 CONTEST #4 T1 CESTA.

Translated by ChatGPT 5