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 math

n = int(input())
s = str(int(input()))
vls = []
nos =''
for i in range(len(s)):
    if(s[i]=='2'):
        nos+='2'
    if(s[i]=='3'):
        nos+='3'
    if(s[i]=='4'):
        nos+='322'
    if(s[i]=='5'):
        nos+='5'
    if(s[i]=='6'):
        nos+='53'
    if(s[i]=='7'):
        nos+='7'
    if(s[i]=='8'):
        nos+='7222'
    elif(s[i]=='9'):
        nos+='7332'
ans = []
for i in range(len(nos)):
    ans.append(int(nos[i]))
ans= sorted(ans, reverse= True)
sans = ''
for i in range(len(nos)):
    sans+=str(ans[i])
print(sans)