D. Dima and Lisa(数论-哥德巴赫猜想)

https://codeforces.com/problemset/problem/584/D

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.

Input

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

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.

Examples

input

Copy

27

output

Copy

3
5 11 11

Note

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

---

1.弱哥德巴赫猜想：一个奇数可以拆成3个以内的质数相加。

哥德巴赫猜想：>=4的合数可以拆成两个质数相加。

2.那先减去3，把n（奇数)变成合数，然后暴力枚举两个质数。

3.素数是密集的，1e9以内，相邻的素数之间的间隔不会大于300，所以直接枚举也不会浪费掉太多的时间。

直接暴力

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
bool primes(LL x){
	for(LL i=2;i<=sqrt(x);i++){
		if(x%i==0) return 0;
	}
	return 1;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  if(n==3){
  	cout<<1<<endl;
  	cout<<3<<endl;
  }
  else if(n==5){
  	cout<<1<<endl;
  	cout<<5<<endl;
  }
  else if(n==7){
  	cout<<1<<endl;
  	cout<<7<<endl;
  }
  else{
  	if(primes(n)){
  		cout<<1<<endl;
		cout<<n<<endl;	
	}
	else{
		cout<<3<<endl;
		cout<<3<<" ";
		n-=3;
		for(LL i=2;i<=n;i++){
			if(primes(n-i)&&primes(i)){
				cout<<i<<" "<<n-i<<endl;
				break;
			} 
		}
	}
  }
return 0;
}