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:
#-*-coding:utf-8-*-

import string
import sys
reload(sys)
sys.setdefaultencoding('utf-8')


# 합성수로 나뉘어진다는 것을 증명
# 합성수 : 1과 그 자신 이외의 수를 약수로 가지는 자연수


n = input()


composite1 = 4
while 1:
	
	# 5부터는 2,3으로 인해서 이전에 필터링이 끝남
	# ex) 25 + 25 = 50 은 4 46 으로도 가능
	composite2 = n -composite1
	if composite2 % 2 == 0 : break
	elif  composite2 % 3 == 0 : break
	

	composite1 = composite1+2


print composite1, composite2