#4. Goldbach's conjecture ( Special Judge Test )

内存限制:256 MiB 时间限制:1000 ms 标准输入输出
题目类型:传统 评测方式:Special Judge
上传者: syzoj

题目描述

At the end of 2018, a Zhihu user "证明" announced that he had proved a Goldbach's conjecture and would post it online on the first day of 2019.

While his proof makes nearly all Zhihuer laugh because it is 'not even wrong'. For more details, please click here.

Now you want to verify the conjecture is correct when the even number n is 'small'. You need to find two prime number a and b that the sum of them is n .

输入格式

The input contains only a even number n .

输出格式

Output two prime number a and b . If there is multiple answers, output any one of them. If there is no answer of the given n , please show your result to the world.

样例

Sample Input

10

Sample Output

3 7

数据范围与提示

6 \leq n < 2^{31}

We guarantee n is even.

In the sample case, if the output "5 5" is also acceptable.