#include <stdio.h>
#define mx 2000010
long i,j,n;
long v[mx],p[mx];

void ciur(int max)
{
	v[0]=1;
	v[1]=2;
	for (i=1; i*i*2+2*i<=max; i++)
	{
		j=i*i*2+2*i;
		while (2*j+1<=max)
		{
			p[j]=1;
			j=j+2*i+1;
		}
	}
	for (i=1; 2*i+1<=max; i++)
		if (p[i]==0)
		{
			v[0]++;
			v[v[0]]=2*i+1;
		}
}

int main()
{
	freopen("ciur.in","r",stdin);
	freopen("ciur.out","w",stdout);
	scanf("%ld",&n);
	ciur(n);
	printf("%ld\n",v[0]);
	if (v[0]>1000)
		j=v[0]-1000;
	else j=1;
	for (i=j; i<=v[0]; i++)
		printf("%ld ",v[i]);
	fclose(stdin);
	fclose(stdout);
	return 0;
}