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>
#include <bits/stdc++.h>
using namespace std;
int n, tab[15];
char a[20];
int main() {
  scanf("%d%s", &n, a);
  for (int i = 0; i < n; ++i)
    if (a[i] != '0' && a[i] != '1') tab[a[i] - '0']++;
  while (tab[9]) {
    tab[9]--;
    tab[7]++;
    tab[3]++;
    tab[3]++;
    tab[2]++;
  }
  while (tab[8]) {
    tab[8]--;
    tab[2]++;
    tab[2]++;
    tab[2]++;
    tab[7]++;
  }
  while (tab[6]) {
    tab[6]--;
    tab[3]++;
    tab[5]++;
  }
  while (tab[4]) {
    tab[4]--;
    tab[2]++;
    tab[2]++;
    tab[3]++;
  }
  for (int i = 9; i >= 2; --i)
    for (int j = 0; j < tab[i]; ++j) printf("%d", i);
  puts("");
  return 0;
}
