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=input()
b=10*[0]

for i in a:
    for j in range(int(i)):
        b[j]+=1

b[1]+=2*b[3]+b[5]+3*b[7]
b[2]+=b[5]+2*b[8]

b[3]=b[5]=b[7]=b[8]=0

#print(b)
ans=[]
for i in range(9,0,-1):
    if i==6 and b[i]!=0:
        for j in range(b[i]):
            ans.append(i+1)
        b[1]-=4*b[i]
        b[2]-=2*b[i]
        b[4]-=b[i]
    elif i==4 and b[i]!=0:
        for j in range(b[i]):
            ans.append(i+1)
        b[1]-=3*b[i]
        b[2]-=b[i]
    elif i==2 and b[i]!=0:
        for j in range(b[i]):
            ans.append(i+1)
        b[1]-=b[i]
    else:
        for j in range(b[i]):
            ans.append(i+1)

print(*ans,sep='')
    
