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>

import sys
import sys
n=int(raw_input(""))
l=map(int,list(raw_input("")))
ans=[]
count=[0,0,0,0,0,0,0,0,0,0]
for i in l:
    count[i]+=1
for i in range(1,9):
    if 10-i==4 and count[10-i]>0:
        count[2]+=(count[4]*2)
        count[3]+=count[4]
    elif 10-i==6 and count[10-i]>0:
        count[5]+=count[6]
        count[3]+=count[6]
    elif 10-i==8 and count[10-i]>0:
        count[7]+=count[8]
        count[2]+=(count[8]*3)
    elif 10-i==9:
        count[7]+=count[9]
        count[3]+=(2*count[9])
        count[2]+=count[9]
        
    else:
        ans.extend([10-i]*count[10-i])
for i in ans:
    sys.stdout.write(str(i))



