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>
a=int(input());b=input();k=["",""];z=[];o=""
for i in range(2,10):
    j=2;r=i
    while(r!=1 and j<4):
        if r%j==0:r//=j;z+=[j]
        else:j+=1
    if r==i:k+=[str(i)]
    else:
        k+=["3"*min(z.count(3),z.count(2))+"2"*(z.count(2)-min(z.count(3),z.count(2)))+"3"*min(str(k[-1]).count("2"),z.count(3)-min(z.count(3),z.count(2)))]
        p=[2]*min(str(k[-2]).count("2"),z.count(3)-min(z.count(3),z.count(2)))
        for i in str(k[-2]):
            if int(i) in p:p.remove(int(i))
            else:k[-1]+=str(i)
    z=[]
gh=""
for i in b:gh+=k[int(i)]
gh.replace(" ","")
print(*sorted(gh,reverse=True),sep="")



