G. Grandpa Frost and the Dreadful Eight

Grandpa Frost has chosen a positive integer $n$.

Your task is to determine if it's possible to rearrange the digits of this number to form a multiple of $8$. The rearranged number must not have leading zeros, meaning no zeros should appear before the first non-zero digit.

Input

The input consists of a single line containing the integer $n$ ($1\le n\le 10^{10^4}$).

Output

If it's impossible to rearrange the digits of $n$ to form a multiple of $8$, output the integer $-1$.

If it is possible, output any number that is a multiple of $8$ and can be formed by rearranging the digits of $n$. If there are multiple valid solutions, you may output any one of them.

Examples