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;

public class Main {

    public static void main(String[] args) {
	    Scanner akash = new Scanner(System.in);

	    int number = akash.nextInt();
	    int ans1=0,ans2=0;

    	if(number%2==0){
	        int temp=number/2;

	        int chack_ans = chack_prime(temp);

	        if(chack_ans!=0){
	            ans1=temp;
	            ans2=temp;
            }

	        else{
	            ans1=temp;
	            ans2=temp;
	            while(true){
                    ans1--;
                    ans2++;
                    int chack_ans1=chack_prime(ans1);
                    int chack_ans2=chack_prime(ans2);

                    if(chack_ans1!=0 && chack_ans2!=0){
                        break;
                    }
	            }
            }
         }
    	else{
    	    int temp=number/2;
    	    ans1=temp;
    	    ans2=temp+1;
    	    while(true) {
                int chack_ans1 = chack_prime(ans1);
                int chack_ans2 = chack_prime(ans2);
                if(chack_ans1!=0 && chack_ans2!=0){
                    break;
                }
                else{
                    ans1--;
                    ans2++;
                }
            }
        }
    	System.out.println(ans1+" "+ans2);
    	akash.close();
    }
    private static int chack_prime(int temp) {
        int a = (int)Math.sqrt(temp);
        int count1=0;

        for(int i=2;i<=a;i++){
            if(temp%i==0){
                count1++;
            }
        }
        return count1;
    }
}