Sum of four primes

Can every natural number be written as a sum of four primes? The answer is yes for every natural number of 8 or more, but David did not know that. He decided to run a program that hunts for a number which cannot be written as a sum of four primes.

A prime is a natural number that is divisible by exactly two distinct natural numbers. For example, 37 is divisible only by 1 and 37, so it is prime.

Given a natural number $n$, find four primes whose sum is $n$. Several answers can exist, so print only the one that comes first in lexicographic order once the four primes are listed in non-decreasing order.

The input has several lines. Each line holds one natural number $n$, where $1 \le n \le 100{,}000{,}000$. The input ends at the end of the file.

Print one line for each input line. Among all primes $p_1 \le p_2 \le p_3 \le p_4$ whose sum is $n$, take the one whose sequence $(p_1, p_2, p_3, p_4)$ is lexicographically smallest, and print the four numbers separated by single spaces. The same prime may be used more than once. If $n$ cannot be written as a sum of four primes, print Impossible. on that line.