When Anna learned about prime numbers at the academy, she told Max. He confided to her that almost any even number can be represented as the sum of two primes.
Anna immediately began to test Max's hypothesis, but she wants:
the sum of the addends to be equal to the given even number;
both addends to be primes;
the difference between the addends to be minimal.
Write a program that will help verify Anna's mathematical investigation.
In a single line, a sequence of even numbers (6 \leq N \leq 20000) tested by Anna is given, separated by spaces. The number of numbers in one sample does not exceed .
For each test case, output on a separate line the required minimal pair of prime numbers. Output the pair in non-decreasing order.
Example 1