PROGRAMMING:Finding prime pairs
Goldbach's conjecture is known to all. Now we don't want to prove this conclusion, but want to arbitrarily take an even number out of the number set that can be expressed in the programming language to find two prime numbers, so that the sum is equal to the even number
If we do this well, we can prove that this conjecture is true
Since there are different prime pairs to represent the same even number, it is specially required that the prime pair to be searched is the one with the closest two values
###Input format:
In the input are some even integers m (5 < m < = 10000000)
###Output format:
For each even number, output two prime numbers closest to each other, the sum of which is equal to the even number
###Input example:
Here is a set of inputs. For example:
```in
20 30 40
```
###Output example:
The corresponding output is given here. For example:
```out
7 13
13 17
17 23
```
answer：If there is no answer, please comment
If we do this well, we can prove that this conjecture is true
Since there are different prime pairs to represent the same even number, it is specially required that the prime pair to be searched is the one with the closest two values
###Input format:
In the input are some even integers m (5 < m < = 10000000)
###Output format:
For each even number, output two prime numbers closest to each other, the sum of which is equal to the even number
###Input example:
Here is a set of inputs. For example:
```in
20 30 40
```
###Output example:
The corresponding output is given here. For example:
```out
7 13
13 17
17 23
```
answer：If there is no answer, please comment