{"trustable":false,"sections":[{"title":"","value":{"format":"PLAIN","content":"In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:\nEvery number greater than 2 can be written as the sum of three prime numbers.\nGoldbach was considering 1 as a primer number, a convention that is no longer followed. Later on,\nEuler re-expressed the conjecture as:\nEvery even number greater than or equal to 4 can be expressed as the sum of two prime\nnumbers.\nFor example:\n• 8 \u003d 3 + 5. Both 3 and 5 are odd prime numbers.\n• 20 \u003d 3 + 17 \u003d 7 + 13.\n• 42 \u003d 5 + 37 \u003d 11 + 31 \u003d 13 + 29 \u003d 19 + 23.\nToday 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.)\nAnyway, your task is now to verify Goldbach’s conjecture as expressed by Euler for all even numbers less than a million."}},{"title":"Input","value":{"format":"PLAIN","content":"The input file will contain one or more test cases.\nEach test case consists of one even integer n with 6 ≤ n \u003c 1000000.\nInput will be terminated by a value of 0 for n."}},{"title":"Output","value":{"format":"PLAIN","content":"For each test case, print one line of the form n \u003d 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.\nIf there is no such pair, print a line saying \"Goldbach\u0027s conjecture is wrong.\" without quotation mark.\n"}},{"title":"","value":{"format":"PLAIN","content":"Sample Input\n\n8\n20\n42\n0\n\nSample Output\n\n8 \u003d 3 + 5\n20 \u003d 3 + 17\n42 \u003d 5 + 37"}}]}