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;
const int32_t INF = 1 << 30;
int main() {
  int n;
  cin >> n;
  vector<int> ncnt(10, 0);
  for (int64_t i = 0; i < n; i++) {
    char c;
    cin >> c;
    ncnt[c - '0']++;
  }
  ncnt[0] = ncnt[1] = 0;
  for (int64_t i = 0; i < ncnt[9]; i++) {
    ncnt[7] += 1;
    ncnt[3] += 2;
    ncnt[2] += 1;
  }
  ncnt[9] = 0;
  for (int64_t i = 0; i < ncnt[8]; i++) {
    ncnt[7] += 1;
    ncnt[2] += 3;
  }
  ncnt[8] = 0;
  for (int64_t i = 0; i < ncnt[6]; i++) {
    ncnt[5] += 1;
    ncnt[3] += 1;
  }
  ncnt[6] = 0;
  for (int64_t i = 0; i < ncnt[4]; i++) {
    ncnt[3] += 1;
    ncnt[2] += 2;
  }
  ncnt[4] = 0;
  for (int64_t i = 0; i < 9; i++) {
    for (int64_t j = 0; j < ncnt[9 - i]; j++) {
      cout << 9 - i;
    }
  }
  cout << endl;
  return 0;
}
