PROGRAMMING:Verification of Goldbach's conjecture
The general meaning of the famous "Goldbach conjecture" in the field of mathematics is that any even number greater than 2 can always be expressed as the sum of two primes. For example: 24 = 5 + 19, where 5 and 19 are prime numbers. The task of this experiment is to design a program to verify that even numbers within 2 billion can be decomposed into the sum of two prime numbers.
###Input format:
Enter an even number N in the range of (2,2 000 000) in a row.
###Output format:
In one line, output the prime decomposition of n according to the format "n = P + Q", where p $$\ Le $$Q are all prime numbers. Because such a decomposition is not unique (for example, 24 can also be decomposed into 7 + 17), it is required to output the solution with the smallest P among all solutions.
###Input example:
```in
twenty-four
```
###Output example:
```out
24 = 5 + 19
```
answer：If there is no answer, please comment
###Input format:
Enter an even number N in the range of (2,2 000 000) in a row.
###Output format:
In one line, output the prime decomposition of n according to the format "n = P + Q", where p $$\ Le $$Q are all prime numbers. Because such a decomposition is not unique (for example, 24 can also be decomposed into 7 + 17), it is required to output the solution with the smallest P among all solutions.
###Input example:
```in
twenty-four
```
###Output example:
```out
24 = 5 + 19
```
answer：If there is no answer, please comment