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 Solve11 {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt(); // Read Number;
		scan.close(); // Close scanner
		int x = 0, y = 0;
		for (int j = 4; j < n; j++) {
			for (int i = 2; i < j; i++) {
				if (j % i == 0) // j 를 i로 나눴을때 나머지가 0 -> 앞에서 부터 확인했을때 약수가 있다.
					x = 1;
			}
			for (int k = 2; k < n - j; k++) {
				if ((n - j) % k == 0) //n-j 를 k로 나눴을때 나머지가 0 -> 뒤에서 부터 확인했을때 약수가 또 있다.
					y = 1;
			}
			if (x == 1 && y == 1) { //뒤와 앞에서 약수를 확인했을때 둘다 약수가 존재한다면
				System.out.println("" + j + " " + (n - j)); // j (앞에서 확인한 수) 와 n-j (뒤에서부터 확인한 수) 를 출력한다.
				return; //탈출.
			}
			x = 0; y = 0;
		}
	}
}
