Description

In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:

Every even number greater than 4 can be
written as the sum of two odd prime numbers.

【描述：在1742年， Christian Goldbach，一位德国数学爱好家，写了封信给Leonhard Euler，在信中他做出这样的猜测。每个比4大的数字都会写成2个素数和的形式。】
For example:

8 = 3 + 5. Both 3 and 5 are odd prime numbers.
20 = 3 + 17 = 7 + 13.
42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23.

Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.)
Anyway, your task is now to verify Goldbach's conjecture for all even numbers less than a million.

【现在仍未证明这个猜想是否正确，（噢等会，我已经有这个猜想的证明，但是写在纸上来说这太长了），无论如何，你的任务是证明他的猜想对于所有小于一百万的数字是否附和。】

Input

The input will contain one or more test cases.
Each test case consists of one even integer n with 6 <= n < 1000000.
Input will be terminated by a value of 0 for n.

【输入包含一组或多组测试样例，每组测试样例由一个6<=n<1000000的偶数组成。输入以0终止.】

Output

For each test case, print one line of the form n = a + b, where a and b are odd primes. Numbers and operators should be separated by exactly one blank like in the sample output below. If there is more than one pair of odd primes adding up to n, choose the pair where the difference b - a is maximized. If there is no such pair, print a line saying "Goldbach's conjecture is wrong."

【对于每组测试样例，输出一行以形式n=a+b,a和b都是素数，数字和运算符号应该用一个空格隔开，如果有不止一对素数组合，选择b-a值最大的那对，如果没有，输出"Goldbach's conjecture is wrong."】

Sample Input

8
20
42
0

Sample Output

8 = 3 + 5
20 = 3 + 17
42 = 5 + 37