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.*;
import java.lang.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class a
{
	public static void main(String[] args)throws Exception{
		Scanner in=new Scanner(System.in);
		//BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
		int n=in.nextInt(),x1=0,x2=0;
		
		if(n%2==0){
			x1=n/2;
			x2=n/2;
		}
		else{
			x1=n/2;
			x2=(n+1)/2;
		}
		while(!(xx(x1) && xx(x2))){
			x1--;
			x2++;
		}
		
		System.out.println(x1+" "+x2);
	}
	public static boolean xx(int n){
		if(n%2==0 && n/2!=1) return true;
		else if(n%3==0 && n/3!=1) return true;
		else if(n%5==0 && n/5!=1) return true;
		else if(n%7==0 && n/7!=1) return true;
		else if(n%11==0  && n/11!=1) return true;
		else return false;
	}
}