Drazil is playing a math game with Varda.

Let's define <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/7020b94c48be2ee5b8eeca05f379c8911bb0e7c4.png" style="max-width: 100.0%;max-height: 100.0%;"/> for positive integer *x* as a product of factorials of its digits. For example, <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/6784d861d9a724d0aeddefcb00b7d0c3442ae586.png" style="max-width: 100.0%;max-height: 100.0%;"/>.

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. <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/7020b94c48be2ee5b8eeca05f379c8911bb0e7c4.png" style="max-width: 100.0%;max-height: 100.0%;"/> = <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/aa57e017a6c74d06b0a54bc47e3f6990e5af38c1.png" style="max-width: 100.0%;max-height: 100.0%;"/>.

Help friends find such number.
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.
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6+9 , MOD = 1e9+7;
int a[N]; int b[N] , dp[N];

int POW(int n)
{

}

bool check(int n)
{

}

int OK (int a)
{

}

void solve()
{
    int n;
    cin >> n;
    string s = "";
    for (int i = 0 ; i < n ; i++)
    {
        char ch;
        cin >> ch;
        if (ch == '4')
        {
            s += '3';
            s += '2';
            s += '2';
        }
        else if (ch == '6')
        {
            s += '3';
            s += '5';
        }
        else if (ch == '8')
        {
            s += '7';
            s += '2';
            s += '2';
            s += '2';
        }
        else if (ch == '9')
        {
            s += '7';
            s += '3';
            s += '3';
            s += '2';
        }
        else if (ch != '1')
        {
            s += ch;
        }
    }
    sort(s.begin() , s.end());
    reverse(s.begin() , s.end());
    cout << s;
    return ;
}


int32_t main()
{
    int t;
    t = 1;
    while (t--)
    {
        solve();
        cout << endl;
    }
    return 0;
}
