One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.

For example, there is a statement called the "Goldbach's conjecture". It says: "each even number no less than four can be expressed as the sum of two primes". Let's modify it. How about a statement like that: "each integer no less than 12 can be expressed as the sum of two composite numbers." Not like the Goldbach's conjecture, I can prove this theorem.

You are given an integer n no less than 12, express it as a sum of two composite numbers.

Input

The only line contains an integer n (12 ≤ n ≤ 106).

Output

Output two composite integers x and y (1 < x, y < n) such that x + y = n. If there are multiple solutions, you can output any of them.

Examples

Input

12


Output

4 8


Input

15


Output

6 9


Input

23


Output

8 15


Input

1000000


Output

500000 500000

Note

In the first example, 12 = 4 + 8 and both 4, 8 are composite numbers. You can output "6 6" or "8 4" as well.

In the second example, 15 = 6 + 9. Note that you can't output "1 14" because 1 is not a composite number.
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Arrays;

public class DesignTutorialLearnFromMath 
{

    public static void main(String[] args) 
    {
        Scanner in=new Scanner(System.in);
        ArrayList<Long> l=new ArrayList<>();
        long n=in.nextLong();
        int count=0;
       if (n<1000)
       {
            for(long i=2;i<=n;i++)
        {
            count=0;
           for(long j=2;j<i;j++)
             {
                 if(i%j ==0)
                    count++;
             }
           if(count!=0)
           {
               l.add(i);
           }
        }
            
             
        long A[]=new long[l.size()];
        for (int i = 0; i < A.length; i++)
        {
            A[i]=l.get(i);
        }
        
      
         for (int i = A.length-1; i >0; i--) 
         {
             
             for (int j = 0; j < A.length; j++) 
             {
                 if (A[i]+A[j]==n)
                 {
                     System.out.println(A[j]+" "+A[i]);
                     return;
                 }
             }
        }
       }
       
          else  if (n%2==0)
       {
           System.out.println(n/2+" "+n/2);
       }
            else
            {
               long num= (n-10+1);
               int i=0;
               int A[]={2,4,6,8,9,10,12};
                while(num+A[i]<n)
                {
                    i++;
                }
                
                System.out.println(num+" "+A[i]);
                    
            }
       
      
    }
    
}
