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 factoriprimi(x):
    lista = []
    ok = 1
    for i in range(2, x//2+1):
        while x % i == 0:
            ok = 0
            lista = lista + [i]
            x = x // i
    if ok == 0:
        return lista
    else: return -1

def produs(lista):
    prod = 1
    for i in lista:
        prod = prod * i
    return prod

def vectfrecv(lista):
    a = [0]*(max(lista)+1)
    for i in lista:
        a[i] = a[i] + 1
    return a

def createfact(frecv, x):
    exista = 0
    for i in range(len(frecv) - 1, 1, -1):
        if frecv[i] == 0 and exista == 1:
            if factoriprimi(i) != -1:
                aux = factoriprimi(i)
                for elem in aux:
                    frecv[elem] -= 1
        elif frecv[i] >= 1 and exista == 0:
            exista = 1
            x = x + [i]
            frecv[i] -= 1
        elif frecv[i] >= 1:
            frecv[i] -= 1
    return frecv, x

def testzero(lista):
    ok = 1
    for i in lista:
        if i != 0:
            ok = 0
    return ok

n = int(input("N = "))
a = int(input("A = "))
l = []
suma = 0
while a!= 0:
    c = a % 10
    suma += c
    while c > 1:
        l = l + [c]
        c -= 1
    a = a//10
prod = produs(l)
div = factoriprimi(prod)
div.sort(reverse=True)

frecv = vectfrecv(div)
x = []
while testzero(frecv) != 1:
    frecv, x = createfact(frecv, x)

x = ''.join(map(str, x))
x = int(x)
print(x)
