Smallest Integer

Problem Description

You are given the frequency of each digit $0\sim 9$: digit $i$ appears $a_i$ times. Using all the given digits, form an integer that satisfies the following conditions and is as small as possible:

• All given digits must be used.
• The leading digit cannot be $0$, unless the result is the single digit $0$.
• No two adjacent digits may be the same.

Find the smallest integer that can be formed.

Input Format

Input $10$ integers $a_0, a_1, \dots, a_9$ ($0\le a_i\le 10^5$), the frequencies of each digit. It is guaranteed that $1\le \sum_{i=0}^{9} a_i \le 10^5$.

Output Format

Output one line containing an integer: the smallest integer that can be formed; if no such integer exists, output -1.

Sample Input

2 0 1 0 0 1 0 2 0 0

Sample Output

205707