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:
__author__ = 'Devesh Bajpai'

'''
https://codeforces.com/problemset/problem/472/A

Solution: The idea is to explore even numbers as much as possible, since only 2 is a prime number.
Also, we'd like to keep at least one number in the pair static since we don't need to validate
both the numbers to be composite. We can split the cases as follows:

1. If n is even, we can try to split it into 2 even numbers > 2. The smallest value possible is
4. When n = 12, the other number is 8. Therefore we generalize 4, n - 4 as the pair. 

2. If n is odd, we can still try to get one number as even > 2. That is possible since odd -
even = odd. Now we need to make sure the other number which is odd, is not a prime since all primes
except 2 are odd. To ensure that safety, we make the odd number static. The smallest values possible 
is 9. When n = 13, the other number is 4. Therefore we generalize, 9, n - 9 as the pair. 
'''


def solve(n):

    if n % 2 == 0:
        result = [4, n - 4]
    else:
        result = [9, n - 9]

    return str(result[0]) + " " + str(result[1])


if __name__ == "__main__":

    n = int(input())
    print(solve(n))