#include<stdio.h>//线性筛选质数
int next[10001],previous[10001];
#define NEXT(x) x=next[x];//取x的前驱
#define PREVIOUS(x) x=previous[x];//取x的后继
#define REMOVE(x) { next[previous[x]]=next[x];\
previous[next[x]]=previous[x];}//删除x
int main()
{
int prime,fact,i,mult,n,count=0;
scanf("%d",&n);
for(i=2;i<=n;i++)//前驱、后继数组的初始化
{
previous[i]=i-1;
next[i]=i+1;
}
previous[2]=next[n]=-1;
for(prime=2;prime*prime<=n;)
{
for(fact=prime;prime*fact<=n;)
{
for(mult=prime*fact;mult<=n;mult*=prime)
//取prime后的还没删除的数作为倍数,
REMOVE(mult);//删除mult,即
NEXT(fact);
}
NEXT(prime);
}
for(i=2;i!=-1;)//输出质素
{
printf("%d ",i);
NEXT(i);
}
printf("\n");
return 0;
}