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.
n = int(raw_input())

#a = [int(x) for x in raw_input().split()]

"""
for i in range(n):
    b = [int(x) for x in raw_input().split()]
    a.append(b)


a = [int(x) for x in raw_input().split()]

c = [0]
for i in range(len(a)):
    d = c[i]-a[i][0]+a[i][1]
    c.append(d)"""

if n % 4 == 0:
    a = n / 2
    b = n / 2
    
elif n % 4 == 2:
    a = n / 2 - 1
    b = a + 2

elif n % 3 == 0:
    a = (n - 3) / 2 
    b = a + 3

elif n % 12 == 1:
    a = (n - 1) / 2 + 3
    b = a - 5

elif n % 12 == 5:
    a = (n - 5) / 2 + 2
    b = a + 1

elif n % 12 == 7:
    a = (n - 7) / 2 + 3
    b = a + 1
elif n % 12 == 11: 
    a = (n - 11) / 2 + 3
    b = a + 5

print a , b