#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

vector<long long> Eratosthenes(long long N){
  vector<bool> v(N+1, true);
  v[0] = v[1] = false;
  long long sqN = sqrt(N);
  for(int i=2; i<=sqN; i++){
    if(v[i] == false) continue;
    for(long long j=i*i; j<=N; j+=i){
      v[j] = false;
    }
  }
  vector<long long> Prime;
  for(long long i=2; i<=N; i++){
    if(v[i]==true) Prime.push_back(i);
  }
  return Prime;
}


int main(){
  int k;
  cin >> k;

  if( k==0 ){
    println(1);
    println(1);
    return 0;
  }

  auto p = Eratosthenes(2000000);

  set<long long> prime(p.begin(), p.end());

  // for(int i=1; i<100; i++){
  //   vector<int> q;
  //   for(int j=1; j<=100; j++){
  //     if( prime.count(i+j) ){
  //       q.push_back(j);
  //     }
  //   }
  //   eprintln(i, ":", q);
  // }

  set<int> used;

  vector<int> ans;

  auto func = [&](int p){
    if(p == 0) return;
    int x = 3;
    while( true ){
      bool ok = true;
      if( used.count(x) ) x++;
      for(auto v : used){
        if( prime.count(x + v) != 0 ){
          ok = false;
        }
      }
      if( ok ) break;
      else x++;
    }

    int y = x+1;
    for(; ; y++){
      if( used.count(y) ) continue;
      if( prime.count(x+y) == 0 ) continue;
      bool ok = true;
      for(auto v : used){
        if( prime.count(y + v) != 0 ){
          ok = false;
        }
      }
      if(ok) break;
    }

    used.insert(x);
    used.insert(y);

    for(int i=0; i<p; i++){
      ans.push_back(x);
      ans.push_back(y);
    }
  };

  for(int a=0; a<=100; a++){
    long long x = a*a;
    if( x > k ) break;
    for(int b=a; b<=100; b++){
      long long y = x + b*b;
      if( y > k || (a+b)*2 > 250 ) break;
      for(int c=b; c<=100; c++){
        long long z = y + c*c;
        if( z > k || (a+b+c)*2 > 250) break;
        int r = k - z;
        int d = sqrt(r);
        long long w = z + d*d;
        if( w > k || (a+b+c+d)*2 > 250) break;

        if( w != k ) continue;

        func(a);
        func(b);
        func(c);
        func(d);

        println(ans.size());
        println(ans);
        return 0;
      }
    }
  }

  assert(false);



  return 0;
}