Dima and Lisa

1000ms

262144K

Description:

Dima loves representing an odd number as the sum of multiple primes, and Lisa loves it when there are at most three primes. Help them to represent the given number as the sum of at most than three primes.

More formally, you are given an odd numer n. Find a set of numbers p_i (1 ≤ i ≤ k), such that

1 ≤ k ≤ 3
p_i is a prime
$\text{[math]}$

The numbers p_i do not necessarily have to be distinct. It is guaranteed that at least one possible solution exists.

Input:

The single line contains an odd number n (3 ≤ n < 10⁹).

Output:

In the first line print k (1 ≤ k ≤ 3), showing how many numbers are in the representation you found.

In the second line print numbers p_i in any order. If there are multiple possible solutions, you can print any of them.

Sample Input:

Sample Output:

3
5 11 11

Note:

A prime is an integer strictly larger than one that is divisible only by one and by itself.

Informação

Provedor Codeforces

Código CF584D