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.io.PrintStream;
import java.util.Scanner;

public class learnMath_472A {

public static void main(String args[]){
	Scanner sc=new Scanner(System.in);
	PrintStream sOut=new PrintStream(System.out);
	int n=sc.nextInt();
	if(n%2==0){
		if(n%4==0)
			sOut.println(n/2+" "+n/2);
		else
			sOut.println(n/2-1+" "+(n/2+1));
	}
	else{
		int n1=0;
		for(int i=2;i<=n;i++)
			if(!isPrime(i)&&i%2!=0){
				n1=i;
				break;
			}
		System.out.println(n1+" "+(n-n1));
	}
}

public static boolean isPrime(int num){
	int arrP[]=new int[num+1];
	for(int i=0;i<=Math.sqrt(num);i++)
		arrP[i]=0;
	
	for(int i=2;i<=(int)Math.sqrt(num);i++){
		if(arrP[i]==0){
			for(int j=2;j*i<=num;j++){
				arrP[j*i]=1;
			}
		}
	}
	
	if(arrP[num]==0)
		return true;
	
	return false;
}
}
