Problem: 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.

Solution (in JAVA):

Solution:


import java.util.Scanner;

/**
 *
 * @author rrv computers
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        long n;
        int ans = 0,ans1 = 0;
        Scanner sc=new Scanner(System.in);
        n=sc.nextLong();
        if(n>=12&&n<=1000000)
        {

               for(long i=0;i<=1000000;i++)
               {
                  for(long j=0;j<=1000000;j++)
                  {
                      if((i+j)==n)
                      {
                        ans=check(i);
                          ans1=check(j);

                      if(ans==1&&ans1==1&&i>1&&j<n)
                      {
                          System.out.println(""+i+" "+j);
                            i=1000000;
                            j=1000000;
                      }
                   }
               }
               }

        }
    }
 static int  check(long num)
    { long i,k;
      int ok=0;
      double rem,k1=num;
    for(i=2;i<=9;i++)
         {
        if(i!=num)
        {
             k1=k1/i;
             k = (int)k1;
             rem=(k1*1000000)-(k*1000000);
             k1=num;
             if(rem==0)
             {
                ok=1;
              }
         }

        }
return ok;
    }

}