#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 100010
int vis[maxn];
int pri[maxn];
int cnt=0;
void prime_table()
{
memset(vis,0,sizeof(vis));
for(int i=2;i<=maxn;i++)
{
if(!vis[i])
pri[cnt++]=i;
for(long long j=(long long) i*i;j<=maxn;j=j+i)
vis[j]=1;
}
}
int main()
{
prime_table();
for(int i=0;i<cnt;i++)
cout<<pri[i]<<endl;
return 0;
}