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.

2. <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.

Examples

Input

4
1234


Output

33222


Input

3
555


Output

555

Note

In the first case, <image>

// 441A     Валера и антиквариат 


var n = parseInt(readline());

// var input_line = readline().split(' ').map(Number);
var arr = readline().split('');

var out = '';

for (var i = 0; i < n; i++) if (arr[i] === '9') out += '7332';
for (var i = 0; i < n; i++) if (arr[i] === '8') out += '7222';
for (var i = 0; i < n; i++) if (arr[i] === '7') out += '7';
for (var i = 0; i < n; i++) if (arr[i] === '6') out += '53';
for (var i = 0; i < n; i++) if (arr[i] === '5') out += '5';
for (var i = 0; i < n; i++) if (arr[i] === '4') out += '322';
for (var i = 0; i < n; i++) if (arr[i] === '3') out += '3';
for (var i = 0; i < n; i++) if (arr[i] === '2') out += '2';

arr = out.split('').sort().reverse();

out = arr.join('');

print(out);


