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())
num = input()
numb = [int(x) for x in num]
while(1 in numb):
    numb.remove(1)
while(0 in numb):
    numb.remove(0)
fnumb = numb.copy()
for i in range(0,len(numb)):
    if (numb[i] == 6):
        fnumb.remove(6)
        fnumb = fnumb + [5,3]
    elif (numb[i] == 4):
        fnumb.remove(4)
        fnumb = fnumb + [3,2,2]
    elif(numb[i] == 8):
        fnumb.remove(8)
        fnumb = fnumb + [7,2,2,2]
    elif(numb[i] == 9):
        fnumb.remove(9)
        fnumb = fnumb + [7,2,3,3]
fnumb.sort(reverse = True)
final = ''
for i in range(0,len(fnumb)):
    final = final + str(fnumb[i])
print(int(final))
    
