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.
class GettingComplex(object):
    def __init__(self):
        self.n = int(input())

    def complex_numbers(self):
        while True:
            try:
                assert 12 <= self.n <= 10 ** 6
                l_digit = self.n % 10

            except ValueError as error:
                print("ValueError: " + str(error))
                print("try again")

            except AssertionError:
                print("Please enter a value ranging from 1 to 100")

            else:
                if l_digit == 7:
                    GettingComplex.num_print(self, 9)
                elif l_digit == 9:
                    GettingComplex.num_print(self, 4)
                elif self.n == 13:
                    GettingComplex.num_print(self, 4)
                elif self.n == 23:
                    GettingComplex.num_print(self, 8)
                elif self.n == 15:
                    GettingComplex.num_print(self, 6)
                elif self.n == 21:
                    GettingComplex.num_print(self, 6)
                elif self.n == 33:
                    GettingComplex.num_print(self, 6)
                elif l_digit == 1 and self.n > 21:
                    GettingComplex.num_print(self, 21)
                elif l_digit == 3 and self.n > 33:
                    GettingComplex.num_print(self, 33)
                elif l_digit == 5 and self.n > 15:
                    GettingComplex.num_print(self, 15)
                elif l_digit % 2 == 0:
                    GettingComplex.num_print(self, 4)
                break

    def num_print(self, a):
        b = self.n - a
        print(a, b)


run = GettingComplex()
run.complex_numbers()
