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.
# Design Tutorial: Learn from Math

num = int(raw_input())

prime = [2, 3, 5, 7]

import math

number = 9
while (number < math.sqrt(num)):
    jud = 1
    judge = True
    i = 0
    while (judge and i < len(prime) and prime[i] <= math.sqrt(number)):
        if number%prime[i] == 0:
            jud = 0
            judge = False
        else:
            i += 1
    if jud == 1:
        prime.append(number)
    number += 2

x = 3
sol = True
while (sol):
    x += 1
    y = num - x
    i = 0
    while (sol and i < len(prime)):
        if x%prime[i] == 0 and x/prime[i] > 1:
            sol = False
        else:
            i += 1
    if sol == False:
        sol = True
        j = 0
        while (sol and j < len(prime)):
            if y%prime[j] == 0 and y/prime[j] > 1:
                sol = False
            else:
                j += 1

print x, y
