Goldbach's hypothesis
Problem
Goldbach's conjecture (until proven) states that any even number (except 2) can be represented as the sum of two prime numbers.
Input
The program receives as input one natural even number
n (
\(3<n<2 \cdot 10^5\)).
Imprint
The program should output two numbers separated by a space. Numbers must be prime and add up to
n.
Examples
| # |
Input |
Output |
| 1 |
4 |
2 2 |
| 2 |
6 |
3 3 |