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())
a = input()
cnt = [0 for i in range(10)]

for i in a:
	if int(i)==9:
		cnt[7]+=1
		cnt[3]+=2
		cnt[2]+=1
	elif int(i) == 8:
		cnt[2]+=3
		cnt[7]+=1
	elif int(i) == 6:
		cnt[3]+=1
		cnt[5]+=1
	elif int(i)==4:
		cnt[3]+=1
		cnt[2]+=2
	else:
		cnt[int(i)] += 1

ans = ''
for i in range(8):
	while(cnt[9-i]>0):
		cnt[9-i]-=1
		ans+=str(9-i)
print(ans)
