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

Solution:
a = int(input())
#half = a//2
prime = [False] * 2 + [True] * (a - 1)

def SieveFunc(N):
    # N represents upto high we want to create a sieve
    # It is usally N=10**6
    # True is for primality
    # $prime=[False]*2 + [True]*(N-1)  declare this before the func
    # Try not to use the argument N
    for i in range(2, int(N ** 0.5) + 1):
        if prime[i]:
            for j in range(i * i, N + 1, i):
                prime[j] = False
SieveFunc(a)
f=0
if a % 2 == 0:
    left= a-8
    while prime[left] :
        left-=1
        f+=1
    else:
        print(8+f,left)
else:
    left= a-9
    while prime[left] :
        left-=1
        f+=1
    else:
        print(9+f,left)