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())
'''2=2 3=3 4=322 5=5 6=53 7=7 8=7222 9=7332'''
a=list(map(int,list(input())))
newint=[]
for i in range(len(a)):
    if(a[i]==2):
        newint.append("2")
    elif(a[i]==3):
        newint.append("3")
    elif(a[i]==4):
        newint.append("322")
    elif(a[i]==5):
        newint.append("5")
    elif(a[i]==6):
        newint.append("53")
    elif(a[i]==7):
        newint.append("7")
    elif(a[i]==8):
        newint.append("7222")
    elif(a[i]==9):
        newint.append("7332")
pog=''.join(map(str, newint))
pog=int(pog)
descending = "".join(sorted(str(pog), reverse=True))
suh=int(descending)
print(suh)
