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

int main() {
    int N = 1000; //Print primes number from 1 to N
	vector<bool> primes(N, true);
    long long  count = 0;
    for(int i = 3; i*i < N; i += 2){
    	for(int j = 3; j*i < N; j+=2){
    		primes[j*i] = false;
    		count++;
    	}
    }
    if(N >= 2) cout << "2 ";
    for(int i = 3; i < N; i+=2){
    	count++;
    	if(primes[i] == true) cout << i << " "; 
    }
	cout << "\ncnt : " << count;

    return 0;
}