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 a[100];
int main() {
  long long int n, x;
  cin >> n >> x;
  int i = 0;
  while (x > 0) {
    if (x % 10 == 2) {
      a[i] = 2;
      i = i + 1;
    }
    if (x % 10 == 3) {
      a[i] = 3;
      i = i + 1;
    }
    if (x % 10 == 4) {
      a[i] = 2;
      a[i + 1] = 2;
      a[i + 2] = 3;
      i = i + 3;
    }
    if (x % 10 == 5) {
      a[i] = 5;
      i = i + 1;
    }
    if (x % 10 == 6) {
      a[i] = 3;
      a[i + 1] = 5;
      i = i + 2;
    }
    if (x % 10 == 7) {
      a[i] = 7;
      i = i + 1;
    }
    if (x % 10 == 8) {
      a[i] = 2;
      a[i + 1] = 2;
      a[i + 2] = 2;
      a[i + 3] = 7;
      i = i + 4;
    }
    if (x % 10 == 9) {
      a[i] = 2;
      a[i + 1] = 3;
      a[i + 2] = 3;
      a[i + 3] = 7;
      i = i + 4;
    }
    x /= 10;
  }
  sort(a, a + i);
  for (int j = i - 1; j >= 0; j--) cout << a[j];
}
