Codeforces Round #270 1001

Codeforces Round #270 1001

A. Design Tutorial: Learn from Math

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

Input

12 

Output

4 8 

Input

15 

Output

6 9 

Input

23 

Output

8 15 

Input

1000000 

Output

500000 500000

 

一个大于12的数，可以用两个合数表示。。。。。。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int main()
{
    int a;
    scanf("%d",&a);
    if(a%2==1)
    {
        cout<<9<<' '<<a-9<<endl;
    }
    else
    {
        cout<<4<<' '<<a-4<<endl;
    }
    return 0;
}