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

x=''
for i in s:
	if int(i)%2==1 and 9>int(i)>1:
		x+=i
	elif int(i)==2:
		x+='2'
	elif int(i)==4:
		x+='322'
	elif int(i)==6:
		x+='53'
	elif int(i)==8:
		x+='7222'
	elif int(i)==9:
		x+='7332'


a=[]
for i in x:
	a.append(int(i))

a.sort()
a.reverse()
l=''
for i in a:
	l+=str(i)

print(l)

