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.
# http://codeforces.com/problemset/problem/472/A

import math

n = int(input())

if n%2==0:
  print(8, n-8)
else:
  print(9, n-9)

# half = n/2

# n1 = int(math.ceil(half))
# n2 = int(math.floor(half))

# # print(n1, n2)

# count = 0
# temp = 0


# while count<1:

#   count1 = 0
#   count2 = 0

#   li = [2, 3, 5, 7, 11, 13, 17, 19, 23, 27, 29, 31]

#   if temp>0:
#     n1+=1
#     n2-=1

#   if n1 in li:
#     li.remove(n1)
#   if n2 in li:
#     li.remove(n2)


#   for i in li:
#     if n1%i==0:
#       count1 += 1
#     if n2%i==0:
#       count2 += 1

#     if (count1>0) and (count2>0):# and (count1==count2):
#       count+=1

#   temp+=1


# print(n1, n2)