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>
raw_input()
r = raw_input()
l = list(r)
l = [int(i) for i in l]
l.sort()
l_2 = []
for x in l:
	if x==2:
		l_2.append(2)
	if x==3:
		l_2.append(3)
	if x==4:
		l_2.append(2)
		l_2.append(2)
		l_2.append(3)
	if x==5:
		l_2.append(5)
	if x==6:
		l_2.append(5)
		l_2.append(3)
	if x==7:
		l_2.append(7)
	if x==8:
		l_2.append(2)
		l_2.append(2)
		l_2.append(2)
		l_2.append(7)
	if x==9:
		l_2.append(7)
		l_2.append(3)
		l_2.append(3)
		l_2.append(2)
l_2.sort()
length = len(l_2)
l_3 = []
for x in range(0,length):
	p = l_2.pop()
	l_3.append(str(p))
print ''.join(l_3)