Drazil is playing a math game with Varda.

Let's define <image> for positive integer x as a product of factorials of its digits. For example, <image>.

First, they choose a decimal number a consisting of n digits that contains at least one digit larger than 1. This number may possibly start with leading zeroes. Then they should find maximum positive number x satisfying following two conditions:

1. x doesn't contain neither digit 0 nor digit 1.

2. <image> = <image>.

Help friends find such number.

Input

The first line contains an integer n (1 ≤ n ≤ 15) — the number of digits in a.

The second line contains n digits of a. There is at least one digit in a that is larger than 1. Number a may possibly contain leading zeroes.

Output

Output a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.

Examples

Input

4
1234


Output

33222


Input

3
555


Output

555

Note

In the first case, <image>
#In the name of Allah

from sys import stdin, stdout
input = stdin.readline

n = int(input())
x = input()[:-1]

res = [0] * 8

for i in x:
    if i != "1" and i != "0":
        res[int(i) - 2] += 1

res[0] += (2 * res[2] + 3 * res[6] + res[7])
res[1] += res[2] + res[4] + (res[7] * 2)
res[2] = 0
res[3] += res[4]
res[4] = 0
res[5] += res[6] + res[7]
res[6] = 0
res[7] = 0

ans = ""

for i in range(9, 1, -1):
    ans += str(i) * res[i - 2]

stdout.write(ans)
