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 PYTHON):

Solution:
n = input()

int_div = int(n/2)
float_div = float(n/2.0)
#print float_div, int_div


def composite(n):
    if (n <= 3):
        return False


    if (n % 2 == 0 or n % 3 == 0):
        return True

    i = 5
    while(i * i <= n):
        if (n % i == 0 or n % (i + 2) == 0):
            return True
        i = i + 6
    return False

#if float_div - int_div != 0:
for x in reversed(range(n)):
    if composite(n-x) and composite(x):
        print n-x, x
        break
    #for x in reversed(range(n)):
#    if x%9==0 and (n-x)%4==0 and x!= 0:
#        break
#print int_div-1, int_div+2
#else:
#    print int_div, int_div