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>
t=int(input())
n=int(input())
l=[]
while(n!=0):
    a=n%10
    n-=a
    n//=10
    l.append(a)
for i in range(len(l)):
    if(l[i]==4):
        l[i]=3
        l.append(2)
        l.append(2)
    elif(l[i]==6):
        l[i]=5
        l.append(3)
    elif(l[i]==8):
        l[i]=7
        l.append(2)
        l.append(2)
        l.append(2)
    elif(l[i]==1 or l[i]==0):
        l[i]=-1
    elif(l[i]==9):
        l[i]=7
        l.append(3)
        l.append(3)
        l.append(2)
l.sort()
l.reverse()
s=""
for i in range(len(l)):
    if(l[i]!=-1):
        s+=str(l[i])
print(int(s))
