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>
from collections import Counter
m={9:([3,3,2,2,2], 7), 8:([2,2,2], 7), 6:([2,3], 5), 4:([2,2], 3)}
rem=[]
ans=[]
n=int(input())
digits=[int(x) for x in input()]
for d in digits:
  if d==7 or d==5 or d==3:
    ans.append(d)
  elif d in m:
    rem+=m[d][0]
    ans.append(m[d][1])
  else:
    rem.append(d)
c=Counter(rem)
k=min(c[3],c[2])
ans+=[3]*k
c[2]-=k
c[3]-=k
if c[3]==0:
  ans+=[2]*c[2]
else:
  last=3**c[3]
  if last!=1:
    ans.append(last)

for d in sorted(ans, reverse=True):
  print(d, end="")
print()
