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>
q=int(input())
a=int(input())
l=[]
i=0
while a!=0:
    r=a%10
    if r==4:
        l.append(2)
        l.append(2)
        l.append(3)
        i=i+2
    elif r==6:
        l.append(5)
        l.append(3)
        i=i+1
    elif r==8:
        l.append(7)
        l.append(2)
        l.append(2)
        l.append(2)
        i=i+3
    elif r==9:
        l.append(7)
        l.append(2)
        l.append(3)
        l.append(3)
        i=i+3
    else:
        if r==0 or r==1:
            i=i-1
        else:
            l.append(r)
    a=a//10
    i=i+1
l.sort()
for j in range(i-1,-1,-1):
    print(l[j],end="")
    
