Sum of prime numbers

Represent the given positive integer n as the sum of one or more primes p[1] + p[2] + ... + p[k] so that the formed expression, if it is viewed as a string, would be lexicographically the smallest.

String should contains only digits from 0 to 9 and sign +. Other symbols are not allowed. The numbers, written in the string, should not start from zero. Strings are compared in ASCII encoding. For example, the character + is less than any digit.

Input

One integer n (2 ≤ n ≤ 9 * 10^18).

Output

Print the required string, the length of which is no more than 10 000 characters.

Examples