#include<bits/stdc++.h>
using namespace std;
using Int = long long;

Int isprime(Int x){
  if(x<=1) return 0;
  for(Int i=2;i*i<=x;i++)
    if(x%i==0) return 0;
  return 1;
}

//INSERT ABOVE HERE
signed main(){
  vector<Int> ps1,ps2;
  for(Int i=11;ps1.size()<250u;i+=6)
    if(isprime(i)) ps1.emplace_back(i);
  for(Int i=13;ps2.size()<250u;i+=6)
    if(isprime(i)) ps2.emplace_back(i);

  Int k;
  cin>>k;
  if(!k){
    cout<<1<<endl<<1<<endl;
    return 0;
  }

  for(Int i=0;i<250;i++){
    for(Int x=1;x<250;x++){
      for(Int y=0;y<250;y++){
	if(k<i*y+x*y+(x*(x-1)/2)) continue;
	if((k-(i*y+x*y+(x*(x-1)/2)))%x) continue;
	Int z=(k-(i*y+x*y+(x*(x-1)/2)))/x;
	//cout<<i<<" "<<x<<" "<<y<<" "<<z<<endl;
	Int n=i+x+y+z;
	if(n>250) continue;
	cout<<n<<endl;
	for(Int j=0;j<x;j++){
	  if(j) cout<<" ";
	  cout<<1;
	}
	for(Int j=0;j<i;j++)
	  cout<<" "<<ps2[j]-2;
	for(Int j=0;j<z;j++)
	  cout<<" "<<ps1[j]-1;
	for(Int j=0;j<y;j++)
	  cout<<" "<<2;
	cout<<endl;
	return 0;
      }
    }
  }
  return 0;
}