## Welcome To SDIBT ACM-ICPC Online Judge

VIRTUAL JUDGE Recent Contest F.A.Qs Forum Home ProblemSet Status Ranklist Contest LoginRegister Exam
Problem 1066. -- Summation of Four Primes

## Summation of Four Primes

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 15  Solved: 0
[Submit][Status][Forum]

## Description

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.

## Input

Each input case consists of one integer n ( n<=10000000) on its own line. Input is terminated by end of file

## Output

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

```

## Sample Output

```3 11 3 7
3 7 13 13
11 11 17 7

```

## Source

[Submit][Status][Forum]

HOME Back

한국어 中文 English
All Copyright Reserved 2008-2010 SDIBT TEAM
GPL2.0 2003-2010 HUSTOJ Project TEAM