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.
def check(n):
    a=[2,3,5,7,11]
    flag=0
    if n in a:
        flag=0
    else:
        if n<12:
            flag=1
        elif n%2==0:
            flag=1
        else:
           
            
           
            
                         
                  for j in range(2,n//2+1):
                     if n%j==0:
                          flag=1
                         
    return flag                      
n=int(input())

if n%4==0:
    print(n//2,n//2)
else:
       
       if n%2==0:
                s=n//2
                w=check(s)
                if w==0:
                    p=s+1
                    q=s-1
                else:
                    p=s
                    q=s
       else:
                s=n//2
                p=s
                q=s+1
                x=check(p)
                if x==0:
                    if p>q:
                       p=p+1
                       q=q-1
                    else:
                        p=p-1
                        q=q+1
                y=check(q)
                if y==0:
                    if q>p:
                      q=q+1
                      p=p-1
                    else:
                        q=q-1
                        p=p+1
                z=check(p)
                if z==0:
                    if p>q:
                       p=p+1
                       q=q-1
                    else:
                        p=p-1
                        q=q+1
                t=check(q)
                if t==0:
                    if q>p:
                      q=q+1
                      p=p-1
                    else:
                        q=q-1
                        p=p+1
                u=check(p)
                if u==0:
                    if p>q:
                       p=p+1
                       q=q-1
                    else:
                        p=p-1
                        q=q+1
                v=check(q)
                if v==0:
                    if q>p:
                      q=q+1
                      p=p-1
                    else:
                        q=q-1
                        p=p+1
       print(p,q) 