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

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

int main() {
    long long l;
    cin >> l;
    int count = 0;
    for (int i = 2; i <= l; ++i) {
        if (isPrime(i)) {
            cout << i << endl;
            count++;
        }
    }
    cout << count << endl;
    return 0;
}