Codeforces Round 292 (Div. 2)
C
Drazil and Factorial
Codeforces
1400
原题
← BD →
翻译中…

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$.
翻译中…
  1. 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.

翻译中…

Note

翻译中…

In the first case, image

翻译中…

样例

Input #1
4
1234
Output #1
33222
InputCopy OutputCopy
Input #2
3
555
Output #2
555
InputCopy OutputCopy
题目信息
题号
515C
时间限制
2 s
内存限制
256 MB
标签
贪心
数学
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。