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()
arr = []
t=0
for i in a:
    if int(i)!=1 and int(i)!=0:
        arr.append(int(i))
        t+=1
final = []
for i in range(t):
    if arr[i]==2:
        final.append(2)
    elif arr[i]==3:
        final.append(3)
    elif arr[i]==4:
        final.append(3)
        final.append(2)
        final.append(2)
    elif arr[i]==5:
        final.append(5)
    elif arr[i]==6:
        final.append(5)
        final.append(3)
    elif arr[i]==7:
        final.append(7)
    elif arr[i]==8:
        final.append(7)
        final.append(2)
        final.append(2)
        final.append(2)
    elif arr[i]==9:
        final.append(7)
        final.append(3)
        final.append(3)
        final.append(2)
final.sort()
final1 = ''
for i in range(-1,-(len(final)+1),-1):
    final1+=str(final[i])

print(final1)
        
        
        