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 DesignTutorialLearnFromMath {

	public static int flag = 0;
	public static int flag1 = 0;
	public static int a = 0;
	public static int b = 0;
	public static int n;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		n = sc.nextInt();
		sc.close();

		if (n % 2 == 0) {
			a = n / 2;
			b = n / 2;
			findComposite(a);
			if (flag > 0) {
				// complete
			} else {
				a--;
				b++;
			}
		} else {
			a = (n / 2);
			b = (n / 2) + 1;

			findCompositeOdd(a, b);
		}

		System.out.println(a + " " + b);
	}

	public static void findComposite(int num) {

		for (int i = 2; i <= num / 2; i++) {
			if (num % i == 0) {
				flag++;
			}
		}
	}

	public static void findCompositeOdd(int num1, int num2) {

		int aa = num1;// 6
		int bb = num2;// 7

		flag = 0;
		flag1 = 0;

		for (int i = 2; i <= bb/2; i++) {// n=13, bb/2 = 6

			if (i <= aa/2) {
				if (aa % i == 0 && flag == 0) {
					flag++;
				}
			}
			if(i<=bb/2) {
				if (bb % i == 0 && flag1 == 0) {
					flag1++;
				}
			}
		}

		if (flag == 0 || flag1 == 0) {
			aa--;
			bb++;
			findCompositeOdd(aa, bb);
		} else {
			a = aa;
			b = bb;
		}
	}
}