#include <stdio.h>  

int N, n, sol[1024], cnt;  
char prim[2000005];  
   
int main(void)  
{  
	int i, j;  
	       
	freopen("ciur.in", "r", stdin);  
	freopen("ciur.out", "w", stdout);  
	
	scanf("%d", &N); 

	for (i = 2; i <= N; ++i)  
		if (!prim[i])  
		{  
			++n;
			sol[++cnt] = i;
			for (j = i+i; j <= N; j += i)  
				prim[j] = 1;  
		}  
	      
	printf("%d\n", n);  
	 
	for (i = 1; i<=cnt; ++i)  
		printf("%d ", sol[i]);  
	printf("\n");  

	return 0;  
}