CF - 749A.Bachgold Problem - 贪心

1.题目描述：

Bachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers. One can prove that such representation exists for any integer greater than 1.

Recall that integer k is called prime if it is greater than 1 and has exactly two positive integer divisors — 1 and k.

Input

The only line of the input contains a single integer n (2 ≤ n ≤ 100 000).

Output

The first line of the output contains a single integer k — maximum possible number of primes in representation.

The second line should contain k primes with their sum equal to n. You can print them in any order. If there are several optimal solution, print any of them.

Example

Input

5

Output

2
2 3

Input

6

Output

3
2 2 2

2.题意概述：

要你把一个数尽可能地拆分成若干质数的和，求质数最大的数量

3.解题思路：

直接贪心的选取2，如果偶数肯定就是若干的2，奇数的话会剩下1，那么2退一位选3就行

4.AC代码：

#include <cstdio>
using namespace std;

int main()
{
	int k;
	scanf("%d", &k);
	printf("%d\n", k / 2);
	for (int i = 0; i < k / 2 - 1; i++)
		printf("%d ", 2);
	if (k % 2)
		printf("%d\n", 3);
	else
		printf("%d\n", 2);
	return 0;
}