CF584D.Dima and Lisa

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. 1 ≤ k ≤ 3
2. p__i is a prime
3. 

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

迪马喜欢将一个奇数表示为多个质数的和，而莉萨则更喜欢其中至多包含三个质数的情形。请帮助他们将给定的数表示为至多三个质数的和。

更准确地说，你将得到一个奇数 $ n $。请找出一组数 $ p_i $（$ 1 \le i \le k $），使得：

1. $ 1 \le k \le 3 $
2. 每个 $ p_i $ 均为质数
3. 

这些 $ p_i $ 不必互不相同。题目保证至少存在一种可行解。

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

单行输入包含一个奇数 $n$（$3 \leq n < 10^9$）。

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.

第一行输出 k（1 ≤ k ≤ 3），表示你所找到的表示中包含的数字个数。

第二行以任意顺序输出数字 p__i。若存在多种可能的解，输出其中任意一个即可。

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

质数是严格大于 1 的整数，且仅能被 1 和它自身整除。