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=sorted(list(map(int,list(input()))))
dic1={}
cnt2,cnt3=0,0
for i in range(10):
    dic1[i]=0
for i in range(n):
    if a[i]==9:
        cnt3+=2
        cnt2+=3
        dic1[7]+=1
    elif a[i]==8:
        cnt2+=3
        dic1[7]+=1
    elif a[i]==6:
        cnt3+=1
        cnt2+=1
        dic1[5]+=1
    elif a[i]==4:
        cnt2+=2
        dic1[3]+=1
    else:
        dic1[a[i]]+=1
s=[]
#print(cnt2,cnt3,dic1)
while cnt3>0 and cnt2>0:
    s.append(3)
    cnt3-=1
    cnt2-=1
#print(s,cnt2,cnt3)
for i in range(cnt2):
    s.append(2)
for i in range(cnt3):
    s.append(3)
#print(s)
for i in range(2,10):
    while dic1[i]>0:
        s.append(i)
        dic1[i]-=1
s=sorted(s,reverse=True)
print("".join(list(map(str,s))))