题目描述
Waring's prime number conjecture states that every odd integer is either prime or the sum of three primes. Goldbach's conjecture is that every even integer is the sum of two primes. Both problems have been open for over 200 years.
In this problem you have a slightly less demanding task. Find a way to express a given integer as the sum of exactly four primes.
输入
Each input case consists of one integer n ( n<=10000000) on its own line. Input is terminated by end of file
输出
For each input case n, print one line of output containing four prime numbers which sum up to n. If the number cannot be expressed as a summation of four prime numbers print the line “Impossible." in a single line. There can be multiple solutions. Any good solution will be accepted.
样例输入
24
36
46
样例输出
3 11 3 7
3 7 13 13
11 11 17 7
参考代码
暂无
解析
暂无
