#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

bool isprime(int n);

int main(){
    int n;
    cin>>n;
    int num[100];
    int result = 0;
    int count = 0;
    for (int i=1;i<=n;i++){
        if (result >= n){
            break;
        }
        if (isprime(i)){
            num[count] = i;
            result += i;
            count++;
        }
    }
    sort(num,num+count);
    for (int i=0;i<count;i++){
        cout<<num[i]<<endl;
    }
    cout<<count;

    return 0;
}

bool isprime(int n) {
    if (n <= 1) {
        return false;
    }
    int k = sqrt(n);
    for (int i = 2; i <= k; i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}