A - Design Tutorial: Learn from Math（哥德巴赫猜想）

Problem description

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 ≤ 10⁶).

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

15

23

1000000

Output

4 8

6 9

8 15

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.

解题思路：每个不小于12的整数可以表示为两个合成数之和，若满足条件有多组，则输出其中的一组，简单判断即可。

AC代码：

 #include<bits/stdc++.h>
 using namespace std;
 bool isprime(int x){
     for(int i=;i*i<=x;++i)
         if(x%i==)return false;
     return true;
 }
 int main(){
     int n;cin>>n;
     for(int i=;;i+=)
         if(!isprime(n-i)){cout<<i<<' '<<(n-i)<<endl;break;}
     return ;
 }