A warehouse's dispatch barcode is printed as a long string of digits with no leading zero. The scanner at the loading dock sometimes misreads the last few printed digits, so the dispatch protocol requires trimming zero or more digits from the right end of the barcode until the last remaining digit is odd -- this is the checksum convention that marks a code as valid for shipping. Among all barcodes obtainable this way, the dock supervisor wants the greatest possible numeric value. Given the original barcode, report that greatest value, or report that no valid trim exists if every digit in the barcode is even (in which case trimming all the way down never lands on an odd digit).

Input format

A single line containing the barcode s, a string of decimal digits whose first character is never '0'.

Output format

Print the greatest numeral obtainable by deleting zero or more digits from the right end of s so that the last remaining digit is odd, with no leading or trailing whitespace. If no such trim exists (every digit of s is even), print -1 instead.

Constraints

• 1 <= |s| <= 10^5
• Every character of s is a digit '0'-'9'.
• s does not start with '0'.

1234567

1234567

246820

-1