CF515C.Drazil and Factorial
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Drazil is playing a math game with Varda.
Let's define for positive integer x as a product of factorials of its digits. For example,
.
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. =
.
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,