PROGRAMMING:Goldbach's latest conjecture
X has a problem with prime numbers and needs your help. Prime number is also called prime number. A natural number greater than 1 can not be divided by other natural numbers except 1 and itself. In other words, the number has no other factors except 1 and itself. Otherwise, it is called composite number. Goldbach is a German mathematician. Born in geonigsberge (now kalininge). He studied in Oxford University. As a former scholar of law, he became interested in mathematical research because he met the Bernoulli family during his visit to European countries. He used to be a middle school teacher. In 1725, he went to Russia and was elected academician of the Petersburg Academy of Sciences in the same year. From 1725 to 1740, he served as the conference Secretary of the Petersburg Academy of Sciences. In 1742, he moved to Moscow and worked in the Russian Foreign Ministry. In 1742, Goldbach discovered in his teaching that every even number no less than 6 is the sum of two prime numbers. For example, 6 = 3 + 3, 14 = 3 + 11 and so on. On June 7, 1742, Goldbach wrote to Euler, the great mathematician at that time. In his reply on June 30, Euler said that he believed the conjecture was correct, but he could not prove it. Such a simple problem can not be proved by such a leading mathematician as Euler, and this conjecture has attracted the attention of many mathematicians. We don't need you to prove Goldbach's conjecture. We assume that Goldbach's conjecture is correct. An even number no less than 6 is the sum of two prime numbers. For example, 14 = 3 + 11 can also be expressed as 14 = 7 + 7. The problem now is to find that n is the sum of at least several primes given a positive integer n..
###Input format:
First, enter a positive integer n to represent the number of test data groups, and then enter n positive integers to represent the number to be processed, one positive integer for each group to meet the range of: 6 ~ 1000000000..
###Output format:
Output will have n lines, each line corresponding to a number of Goldbach's latest guess this number at least prime number..
###Input example:
Here is a set of inputs. For example:
```in
two
nine
eleven
```
###Output example:
The corresponding output is given here. For example:
```out
two
one
```
answer：If there is no answer, please comment
###Input format:
First, enter a positive integer n to represent the number of test data groups, and then enter n positive integers to represent the number to be processed, one positive integer for each group to meet the range of: 6 ~ 1000000000..
###Output format:
Output will have n lines, each line corresponding to a number of Goldbach's latest guess this number at least prime number..
###Input example:
Here is a set of inputs. For example:
```in
two
nine
eleven
```
###Output example:
The corresponding output is given here. For example:
```out
two
one
```
answer：If there is no answer, please comment