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()
cnt2=0
cnt3=0
cnt5=0
cnt7=0
for charr in s:
	if charr=="2":
		cnt2+=1
	elif charr=="3":
		cnt3+=1
	elif charr=="4":
		cnt2+=2
		cnt3+=1
	elif charr=="5":
		cnt5+=1
	elif charr=="6":
		cnt3+=1
		cnt5+=1
	elif charr=="7":
		cnt7+=1
	elif charr=="8":
		cnt2+=3
		cnt7+=1
	elif charr=="9":
		cnt2+=1
		cnt3+=2
		cnt7+=1
print(cnt7*"7"+cnt5*"5"+cnt3*"3"+cnt2*"2")