CF 472A Design Tutorial: Learn from Math

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.

题解：输入一个数n，分解出两个合数（不是素数），只要满足就行，

   本来以为对于100的倍数需要除以2特判，谁知道并不需要；

AC代码：

#include <bits/stdc++.h>
using namespace std ;
int prime(int x)
{
    for(int i = 2; i<x; i++)
    {
        if(x%i==0) return 0 ;
    }
    return 1 ;
}
int main()
{
    int n ;
    cin>>n;

        for(int i =4; i<=n/2 ; i++)
        {
            if(prime(i)==0)
            {
                if(prime(n-i)==0)
                {
                    printf("%d %d\n",i,n-i);
                    break;
                }
            }
        }
    return 0 ;
}