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.*;
public class drazilandfact
{
    public static void main(String args[])
    {
        Scanner in=new Scanner(System.in);
        long n=in.nextLong();
        long m=in.nextLong();
        long a1;int i=0,j,key1;
        String s="",s1="";
        long b[]=new long[2^63-1];
        a1=m;
        while(a1!=0)
        {
            if(a1%10!=0 && a1%10!=1)
            {
                s1+=(a1%10);
            }
            a1/=10;
        }
        for(j=0;j<s1.length();j++)
        {
            char ch=s1.charAt(j);
            if(ch=='4')
             s+=322;
            else if(ch=='6')
             s+=53;
            else if(ch=='8')
             s+=7222;
            else if(ch=='9')
             s+=7332;
            else
             s+=ch;
            }
        for(i=0;i<s.length();i++)
        {
            b[i]=(int)s.charAt(i);
        }
         for (i =1; i <s.length(); i++)
   {
       key1=(int)b[i];
       j = i-1;
       while (j >= 0 && b[j] < key1)
       {
           b[j+1]=b[j];
           j = j-1;
       }
       b[j+1]=key1;
   }
   for(i=0;i<s.length();i++)
    System.out.print((char)b[i]);
}
}
