PROGRAMMING:Goldbach conjecture
Goldbach's conjecture is very familiar to everyone. The common conjecture statement today is Euler's version, that is, any even number greater than 2 can be written as the sum of two prime numbers, also known as "strong Goldbach's conjecture" or "Goldbach's conjecture on even numbers". Since an even number may have many different prime pairs, it is required to output two prime pairs closest to each other
###Input format:
The input has multiple lines, each line has an even integer n (5 < n < = 10000)
###Output format:
For each even number, output two prime numbers closest to each other, the sum of which is equal to the even number (the smaller prime number is placed before the larger prime number)
###Input example:
Here is a set of inputs. For example:
```in
twenty
thirty
forty
```
###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
###Input format:
The input has multiple lines, each line has an even integer n (5 < n < = 10000)
###Output format:
For each even number, output two prime numbers closest to each other, the sum of which is equal to the even number (the smaller prime number is placed before the larger prime number)
###Input example:
Here is a set of inputs. For example:
```in
twenty
thirty
forty
```
###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