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())
s = str(input())

two = 0
three = 0
five = 0
seven = 0
ans = ''

for a in s:
    if a == '2':
        two += 1
    if a == '3':
        three += 1   
    if a == '4':
        two += 2
        three += 1
    if a == '5':
        five += 1
    if a == '6':
        five += 1
        three += 1
    if a == '7':
        seven += 1
    if a == '8':
        seven += 1
        two += 3
    if a == '9':
        seven += 1
        three += 2
        two += 1    

for i in range(seven):
    ans += '7'
for i in range(five):
    ans += '5' 
for i in range(three):
    ans += '3'
for i in range(two):
    ans += '2'  

print(ans)    