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>
import java.util.*;
import java.io.*;
public class codeforces
{
    public static void main(String args[])throws IOException
    {
       Scanner sc=new Scanner(System.in);
       int n=sc.nextInt();
       String s=sc.next();
       int arr[]=new int[10];
       for(int i = 0 ;i<s.length();i++)
       arr[s.charAt(i)-48]++;
       for(int i=4;i<=9;i++)
       {
           int count=arr[i];
           if(i==4)
           {
               arr[3]+=count;
               arr[2]+=2*count;
               arr[4]=0;
           }
           else if(i==6)
           {
               arr[5]+=count;
               arr[3]+=count;
               arr[6]=0;
           }
           else if(i==8)
           {
               arr[7]+=count;
               arr[2]+=3*count;
               arr[8]=0;
            }
           else if(i==9)
           {
               arr[9]=0;
               arr[7]+=count;
               arr[2]+=count;
               arr[3]+=2*count;
               
           }
       }
       for(int i=9;i>=2;i--)
       {
           int count=arr[i];
           while(count-->0)
           System.out.print(i);
        }
    }
}  