测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A9837. Drazil and Factorial

编程题 普及/提高-

题目描述

Drazil is playing a math game with Varda.

Let's define ![](/uploads/luogu/CF515C/d6d82501d6896204eb129fda0fbb874a4dca8b3d_6c01579ad12c.png) for positive integer $x$ as a product of factorials of its digits. For example, ![](/uploads/acgo/image/9928e5d82208831d_9e76ce1fb226.jpeg).

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\. ![](/uploads/luogu/CF515C/d6d82501d6896204eb129fda0fbb874a4dca8b3d_6c01579ad12c.png) = ![](/uploads/acgo/image/8950f7dfdc556999_86c7322db150.jpeg).

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.

输出格式

Output a maximum possible integer satisfying the conditions above. There should be no zeroes and ones in this number decimal representation.

输入输出样例

输入 #1
4
1234
输出 #1
33222
输入 #2
3
555
输出 #2
555

说明/提示

In the first case, ![](/uploads/acgo/image/e1ae23dd42576882_b98d39d31627.jpeg)
上一题 去做题 下一题