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 = int(input())
a = int(input())
prost = [0] * 4
a = str(a)
x = ""
for i in a:
    if i == "2":
        prost[0] += 1
    elif i == "3":
        prost[1] += 1
    elif i == "4":
        prost[0] += 2
        prost[1] += 1
    elif i == "5":
        prost[2] += 1
    elif i == "6":
        prost[2] += 1
        prost[1] += 1
    elif i == "7":
        prost[3] += 1
    elif i == "8":
        prost[0] += 3
        prost[3] += 1
    elif i == "9":
        prost[0] += 1
        prost[1] += 2
        prost[3] += 1
if prost[3] > 0:
    x += "7" * prost[3]
if prost[2] > 0:
    x += "5" * prost[2]
if prost[1] > 0:
    x += "3" * prost[1]
if prost[0] > 0:
    x += "2" * prost[0]
print(x)
