// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

const int S = 2000000;
bool is_prime[S+10];

int K;
 
signed main() {
    memset(is_prime, true, sizeof(is_prime));
    is_prime[0] = is_prime[1] = false;
    for(int i=2; i<=S; i++) {
        if(!is_prime[i]) continue;
        // printf("prime: %lld\n", i);
        for(int k=2*i; k<=S; k+=i) {
            is_prime[k] = false;
        }
    }

    cin >> K;
    if(K == 0) {
        cout << 1 << endl << 4 << endl;
        return 0;
    }

    vector<int> ans;
    int A = 1; while(A*(A-1) / 2 <= K) A++;
    A--;

    for(int i=0; i<A; i++) ans.push_back(1);
    const int X = 8;
    const int Y = 14;
    ans.push_back(X);
    ans.push_back(X);
    ans.push_back(Y);

    K -= A*(A-1) / 2;
    for(int i=3; K>1; i+=2) {
        if(is_prime[i+X] && !is_prime[i+Y]) {
            K -= 2;
            ans.push_back(i);
        }
    }
    
    for(int i=3; K>0; i+=2) {
        if(!is_prime[i+X] && is_prime[i+Y]) {
            K--;
            ans.push_back(i);
        }
    }

    cout << ans.size() << endl;
    for(size_t k=0; k<ans.size(); k++) {
        cout << ans[k] << " \n"[k+1 == ans.size()];
    }
    /*
    for(int i=1; i*(i-1) <= K; i++) {
        int rest = K - (i * (i - 1));
        if(rest % i != 0) continue;
        int A = i, B = rest / i;
        if(A + B > 250) continue;

        printf("A = %lld, B = %lld\n", A, B);
        vector<int> ans;
        for(int k=0; k<A; k++) ans.push_back(1);
        for(int k=0; k<B; k++) ans.push_back(2);


        return 0;
    }
    */
    return 0;
}