Drazil is playing a math game with Varda.

Let's define <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/7020b94c48be2ee5b8eeca05f379c8911bb0e7c4.png" style="max-width: 100.0%;max-height: 100.0%;"/> for positive integer *x* as a product of factorials of its digits. For example, <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/6784d861d9a724d0aeddefcb00b7d0c3442ae586.png" style="max-width: 100.0%;max-height: 100.0%;"/>.

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. <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/7020b94c48be2ee5b8eeca05f379c8911bb0e7c4.png" style="max-width: 100.0%;max-height: 100.0%;"/> = <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/aa57e017a6c74d06b0a54bc47e3f6990e5af38c1.png" style="max-width: 100.0%;max-height: 100.0%;"/>.

Help friends find such number.
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.
n = int(input())
string = str(input())
arr = [int(x) for x in string]
# print(arr)
i = n-1
arr2 = []
arr3 = []
arr5 = []
arr7 = []
while i >= 0:
    # if arr[i] == 1:
    #     i-=1
    if arr[i] == 2:
        arr2.append(2)
        i-=1
    elif arr[i] == 3:
        arr3.append(3)
        i-=1
    elif arr[i] == 4:
        arr3.append(3)
        arr2.append(2)
        arr2.append(2)
        i-=1
    elif arr[i] == 5:
        arr5.append(5)
        # print("h")
        i-=1
    elif arr[i] == 6:
        arr5.append(5)
        arr3.append(3)
        i-=1
    elif arr[i] == 7:
        arr7.append(7)
        i-=1
    elif arr[i] == 8:
        arr2.append(2)
        arr2.append(2)
        arr2.append(2)
        arr7.append(7)
        i-=1
    elif arr[i] == 9:
        arr7.append(7)
        arr2.append(2)
        arr3.append(3)
        arr3.append(3)
        i-=1
    else:
        i-=1
ans = []

while len(arr7) != 0:
    x = arr7.pop()
    ans.append(x)
while len(arr5) != 0:
    y = arr5.pop()
    ans.append(y)
while len(arr3) != 0:
    x = arr3.pop()
    ans.append(x)
while len(arr2)!=0:
    x= arr2.pop()
    ans.append(x)
print(*ans)