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())
n1=n//2
n2=n-n1
flag1=flag2=0

def comp(x,y):
    temp1 = x
    temp2 = y
    x = max(temp1, temp2)
    y = min(temp1, temp2)
    return x,y
def nod(x,y):
    x1,y1=comp(x,y)
    while (x1%y1!=0):
        x1,y1=comp(x1%y1,y1)
    return y1

while 1:
    for i in range(2,13):
        if flag1==0:
            if nod(n1,i)!=1 and nod(n1,i)!=n1:
                flag1=1
        if flag2==0:
            if nod(n2,i)!=1 and nod(n2,i)!=n2:
                flag2=1
    if flag1+flag2==2:
        print (n1,n2)
        break
    flag1=0
    flag2=0
    n2+=1
    n1-=1