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 vis[18];
void chk() {
  for (int i = 9; i > 1; i--) {
    if (i == 4) {
      vis[2] += 2 * vis[4];
      vis[3] += vis[4];
      vis[4] = 0;
    } else if (i == 6) {
      vis[3] += vis[6];
      vis[5] += vis[6];
      vis[6] = 0;
    } else if (i == 8) {
      vis[2] += 3 * vis[8];
      vis[7] += vis[8];
      vis[8] = 0;
    } else if (i == 9) {
      vis[2] += vis[9];
      vis[3] += 2 * vis[9];
      vis[7] += vis[9];
      vis[9] = 0;
    }
    while (vis[i]--) putchar('0' + i);
  }
  return;
}
int main() {
  int n;
  char c;
  scanf("%d", &n);
  while ((c = getchar()) != EOF && isdigit(c) == 0)
    ;
  vis[c - '0']++;
  while ((c = getchar()) != EOF && isdigit(c)) vis[c - '0']++;
  chk();
  return 0;
}
