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:
n=int(input())
if n%2==0:
    if (n//2)%2==0:
        print(n//2,n//2)
    else:
        print(n//2-1,n//2+1)
else:
    print(9,n-9)
'''N=10000000
s=[True]*N
p=2
while p**2<=N:
    if s[p]:
        for i in range(p*2,N,p):
            s[i]=False
    p+=1
n=int(input())
a=b=n//2
if s[a]:
    a-=1
    while a+b!=n:
        while s[a]:
            a-=1
        while s[b]:
            b+=1
    print(a,b)
elif s[b]:
    b+=1
    while a+b!=n:
        while s[a]:
            a-=1
        while s[b]:
            b+=1
else:
    print(a,b)'''