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.
def cf2():
    fr[2] = fr[2] + 1

def cf3():
    cf2()
    fr[3] = fr[3] + 1

def cf4():
    cf3()
    fr[2] = fr[2] + 2

def cf5():
    cf4()
    fr[5] = fr[5] + 1

def cf6():
    cf5()
    fr[2] = fr[2] + 1
    fr[3] = fr[3] + 1

def cf7():
    cf6()
    fr[7] = fr[7] + 1

def cf8():
    cf7()
    fr[2] = fr[2] + 3

def cf9():
    cf8()
    fr[3] = fr[3] + 2

def ad4():
    fr[2] = fr[2] - 2
    fr[4] = fr[4] + 1

def ad6():
    fr[2] = fr[2] - 1
    fr[3] = fr[3] - 1
    fr[6] = fr[6] + 1

fr = [0] * 10

n = int(input("n = "))
a = int(input("a = "))

acpy = a
print(a)
for i in range(1, n + 1):
    x = int(acpy % 10)
    print(x)
    if x == 2:
        cf2()
    elif x == 3:
        cf3()
    elif x == 4:
        cf4()
    elif x == 5:
        cf5()
    elif x == 6:
        cf6()
    elif x == 7:
        cf7()
    elif x == 8:
        cf8()
    elif x == 9:
        cf9()
    acpy = acpy / 10

print(fr)
numar = ""

while fr[7] != 0:
    ad6()
    ad4()
    numar = numar + "7"
    for j in range (7, 1, -1):
        fr[j] = fr[j] - 1

while fr[5] != 0:
    ad4()
    numar = numar + "5"
    for j in range (5, 1, -1):
        fr[j] = fr[j] - 1

while fr[3] != 0:
    numar = numar + "3"
    fr[3] = fr[3] - 1
    fr[2] = fr[2] - 1

while fr[2] != 0:
    numar = numar + "2"
    fr[2] = fr[2] - 1

print(numar)