2

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

bool isPrime(int x) {
if (x < 2) return false;
if (x == 2) return true;
if (x % 2 == 0) return false;
for (int i = 3; i * i <= x; i += 2) {
if (x % i == 0)
return false;
}
return true;
}

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

int sum = 0, count = 0;
int i = 2;

while (true) {
    if (isPrime(i)) {
        if (sum + i > L) break; 

        cout << i << endl;
        sum += i;
        count++;
    }
    i++;
}

cout << count << endl;
return 0;

}