#include <iostream>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <queue>
#include <fstream>
#include <stdio.h>
#include <string.h>
#include <iomanip>
#include <stack>
#include <climits>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;

ifstream fin("ciur.in");
ofstream fout("ciur.out");

int n;
bitset<2000002> v;

void Ciur(int n)
{
	int i, j;
	v[0] = v[1] = true;
	for (i = 4; i <= n; i += 2)
		v[i] = true;
	for (i = 3; i * i <= n; i += 2)
		if (!v[i])
			for (j = i * i; j <= n; j += 2 * i)
				v[j] = true;
}

int main()
{
	fin >> n;
	int cnt = 0;
	Ciur(n);
	for (int i = 1; i <= n; i++)
		if (!v[i]) cnt++, cout << i << " ";
	fout << cnt;
	return 0;
}