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.
/**
 * Created by MalhotR1 on 05/20/2018.
 */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class DesignTutorial {
    public static void main(String[] args) throws IOException {
        try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
//            Integer N = br.readLine().trim().split(" ");
            int n = Integer.parseInt(br.readLine().trim());
                int k = n >> 1;
                if (n % 2 == 0) {
                    if (isPrime(k)) {
                        k--;
                        System.out.println(k + " " + (n - k));
                    } else {
                        System.out.println(k + " " + k);
                    }
                } else {
                    int last = 0;
                    if (n < 50) last = k + 1;
                    else last = (int) Math.sqrt(n) + 1;
                    int[] arr = new int[last];
                    for (int j = 2; j < arr.length; j++) {
                        if (j <= 3) {
                            arr[j] = -1;
                        }
                        for (int l = j + 2; l < arr.length; l += 2) {
                            if (l % j == 0) arr[l] = 1;
                        }
                    }

                    for (int j = 4; j < arr.length; j++) {
                        if (arr[j] == 1 && !isPrime(n - j)) {
                            System.out.println(j + " " + (n - j));
                            break;
                        }
                    }

                }
            }
        }

    private static boolean isPrime(int k) {
        int sq = (int) Math.sqrt(k);
        for (int i = 2; i <= sq; i++) {
            if (k % i == 0) return false;
        }
        return true;
    }

}
