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>
n = input()
a = list(raw_input())
digs = [a.count(str(i)) for i in xrange(10)]
digs = [sum(digs[i:]) for i in xrange(10)]

digs[3] += digs[6] + digs[9]*2
digs[2] += digs[4]*2 + digs[6] + digs[8]*3

ans = ""
while digs[7]:
    ans += "7"
    digs[2] -= 4
    digs[3] -= 2
    digs[5] -= 1
    digs[7] -= 1
while digs[5]:
    ans += "5"
    digs[2] -= 3
    digs[3] -= 1
    digs[5] -= 1
while digs[3]:
    ans += "3"
    digs[2] -= 1
    digs[3] -= 1
print ans + "2"*digs[2]

