#include<iostream>

 #include<cstdio>

 #include<cmath>

 #include<algorithm>

 #include<queue>

 #include<cstring>

 #define PAU putchar(' ')

 #define ENT putchar('\n')

 using namespace std;

 const int maxn=+;

 bool pri[maxn];

 void makepri(int n){

     int lim=sqrt(n);memset(pri,true,sizeof(pri));

     for(int i=;i<=lim;i++)if(pri[i])for(int j=i*i;j<=n;j+=i)pri[j]=false;return;

 }

 inline int read(){

     int x=,sig=;char ch=getchar();

     while(!isdigit(ch)){if(ch=='-')sig=-;ch=getchar();}

     while(isdigit(ch))x=*x+ch-'',ch=getchar();

     return x*=sig;

 }

 inline void write(int x){

     if(x==){putchar('');return;}if(x<)putchar('-'),x=-x;

     int len=,buf[];while(x)buf[len++]=x%,x/=;

     for(int i=len-;i>=;i--)putchar(buf[i]+'');return;

 }

 int n;

 void init(){

     n=read();makepri(n);

     for(int i=;i<=n;i++) if(pri[i]) write(i),ENT;

     return;

 }

 void work(){

     return;

 }

 void print(){

     return;

 }

 int main(){init();work();print();return ;}