#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> ps;
  for(Int i=5;ps.size()<100u;i++)
    if(isprime(i)) ps.emplace_back(i);

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

  for(Int i=1;i<=100;i++){
    if(k%i) continue;
    Int n=i+(k/i);
    if(n>250) continue;
    cout<<n<<endl;
    for(Int j=0;j<i;j++){
      if(j) cout<<" ";
      cout<<ps[i]-2;
    }
    for(Int j=0;j<(k/i);j++)
      cout<<" "<<2;
    cout<<endl;
    return 0;
  }
  return 0;
}