#include <iostream>
#include <cmath>
int prime(int x);
using namespace std;
int main()
{
    int L, i = 2, count = 0, sum = 0;
    cin >> L;
    if (L < 2) {
        cout << 0;
    } else if (L == 2) {
        cout << 2 << endl << 1;
    } else {
        while (sum < L) {
            if (prime(i)) {
                cout << i << endl;
                sum += i;
                count++;
            }
            i++;
            if (sum + i > L) break;
        }
    }
    cout << count;
    return 0;
}
int prime(int x)
{
    if (x == 1) return 0; 
    if (x == 2) return 1;
    int i;
    for (i = 2; i * i <= x; i++) { 
        if (x % i == 0) {
            return 0;
        }
    }
    return 1;
}