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 static java.lang.Integer.min;
import java.math.BigInteger;
import java.util.*;

public class CF {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);

        //LinkedHashSet<Integer> list = new LinkedHashSet<>();
        long num;
        num = input.nextLong();

        if (num % 2 == 0) {
            
            System.out.println(4+" "+(num-4));
        } else {
            long one, two, flag = 0;
            one = num / 2;  /// 13 -> 9 4   13/2=6
            two = num-one ;
            if (one % 2 == 0) {
                while (true) {
                    two = num - one; ///13-6=7
                    for (long i = 2; i <= two / 2; i++) {
                        if (two % i == 0) {
                            flag = 0;
                            System.out.println(one + " " + two);
                            return;
                        } else {
                            flag = 1;
                        }
                    }
                    if(flag==1)
                    {
                        one = one - 2; //6-2=4
                    }
                }
            }
            else     //15->9 6   15/2=7
            {
                while (true) {
                    one = num - two; ///15-7=8
                    for (long i = 2; i <= one / 2; i++) {
                        if (one % i == 0) {
                            flag = 0;
                            System.out.println(one + " " + two);
                            return;
                        } else {
                            flag = 1;
                        }
                    }
                    if(flag==1)
                    {
                        two = two - 2; //8-2=6
                    }
                }
            }
        }

    }
}