The evil followers of prime numbers have cursed KSA students so they cannot speak some of the ten digits.
You must create a non-prime number using the remaining $N$ digits to save KSA. Digits can be used repeatedly, and the resulting number must be a non-negative integer less than or equal to $10^{12}$.
Input
The first line contains an integer $N$.
The second line contains $N$ available space-separated digits $d_1, d_2, \cdots, d_N$.
Output
On the first line, print YES if a non-prime number satisfying the conditions exists and NO otherwise.
If such a number exists, print it on the second line. You should not print unnecessary leading zeros.
If there are multiple solutions, print any of them.
Constraints
- $1 \leq N \leq 10$
- $0 \le d_1 < d_2 < \cdots < d_N \le 9$
Scoring
| No. | Points | Constraints |
|---|---|---|
| $1$ | $15$ | At least one of $0$, $2$, $4$, $6$, and $8$ is available |
| $2$ | $85$ | No additional constraints |
Examples
Input 1
4 2 3 6 7
Output 1
YES 672