116. Index of superprime
time limit per test: 0.25
sec. Let P_{1}, P_{2}, … ,P_{N}, … be a sequence of prime numbers. Superprime number is such a prime number that its current number in prime numbers sequence is a prime number too. For example, 3 is a superprime number, but 7 is not. Index of superprime for number is 0 iff it is impossible to present it as a sum of few (maybe one) superprime numbers, and if such presentation exists, index is equal to minimal number of items in such presentation. Your task is to find index of superprime for given numbers and find optimal presentation as a sum of superprimes. Input There is a positive integer number in input. Number is not more than 10000. Output Write index I for given number as the first number in line. Write I superprimes numbers that are items in optimal presentation for given number. Write these I numbers in order of nonincreasing. Sample Input 6 Sample Output 2 3 3  
