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.Scanner;

public class GolbachConjecture240A {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		boolean primes[] =  sieveOfPrimeOptimum(1000000);
		int n = s.nextInt();
		int count = 4;
		
		while(true) {
			if(!primes[n-count]) {
				System.out.println(count+" "+(n-count));
				break;
			}
			count+=2;
		}
	}
	
	private static boolean[] sieveOfPrimeOptimum(int n) {   //brute force and values are set again and again i.e for 2 8 is set false for 4 again 8 is set false
		boolean res[] = new boolean[n+1];
		
		res[0] = false;
		res[1] = false;
		res[2] = true;
		for(int fill= 3;fill<=n;fill+=2) { 
			res[fill] = true;
		}
		

		
		for(int i=3;i*i<=n;i=i+2) { 
			
			if(res[i]) {
			for(int j = i*i;j<=n;j+=i) {
				res[j] = false;
			}
			}
		}
		
		return res;
	}

}
