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>
def arin():
    arr = list(map(int,input().strip().split(' ')))
    return arr
n = int(input())
s = input()
arr=[0 for i in range(10)]
for i in s:
    j=int(i)
    if(j==5 or j==7 or j==2):
        arr[j]+=1
    elif(j==9):
        arr[7]+=1
        arr[2]+=3
        arr[3]+=2
    elif(j==8):
        arr[2]+=3
        arr[7]+=1
    elif(j==4):
        arr[3]+=1
        arr[2]+=3
    elif(j==6):
        arr[3]+=1
        arr[5]+=1
        arr[2]+=1
    elif(j==3):
        arr[2]+=1
        arr[3]+=1

s=""
for i in range(arr[7]):
    s+='7'
for i in range(arr[5]):
    s+='5'
for i in range(arr[3]):
    s+='3'
arr[2]-=arr[3]
for i in range(arr[2]):
    s+='2'
print(s)


