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())
sl=input()
cnt=[ 0 for i in range(10) ]
for i in range(n):
    k=int(sl[i])
    if k==2 or k==3 or k==5 or k==7: 
        cnt[k]+=1 
    elif k==4:
        cnt[2]+=2
        cnt[3]+=1
    elif k==6:
        cnt[3]+=1
        cnt[5]+=1
    elif k==8:
        cnt[2]+=3
        cnt[7]+=1
    elif k==9:
        cnt[3]+=2
        cnt[2]+=1
        cnt[7]+=1    
ans=""
for j in range(9,1,-1):
    if cnt[j]>0:
        ans+=cnt[j]*str(j)
print(ans)
