#include<bits/stdc++.h>
using namespace std;
long long int ma=100005;
long long int prime[3000], primem;
long long int mark[100005];
void seive()
{
long long int i,j;
for(i=2;i<=sqrt(ma);i++)
{
if(mark[i]==0)
{
prime[primem++]=i;
for(j=i*i;j<=ma;j+=i)
{
mark[j]=1;
}
}
}
}
int main()
{
int n,i;
cin>>n;
seive();
for(i=0;prime[i]<n;i++)
cout<<prime[i]<<endl;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKbG9uZyBsb25nIGludCBtYT0xMDAwMDU7CmxvbmcgbG9uZyBpbnQgcHJpbWVbMzAwMF0sIHByaW1lbTsKbG9uZyBsb25nIGludCBtYXJrWzEwMDAwNV07CnZvaWQgc2VpdmUoKQp7CiAgICBsb25nIGxvbmcgaW50IGksajsKICAgIGZvcihpPTI7aTw9c3FydChtYSk7aSsrKQogICAgewogICAgICAgIGlmKG1hcmtbaV09PTApCiAgICAgICAgewogICAgICAgICAgICAgcHJpbWVbcHJpbWVtKytdPWk7CiAgICAgICAgICAgIGZvcihqPWkqaTtqPD1tYTtqKz1pKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBtYXJrW2pdPTE7CgogICAgICAgICAgICB9CgogICAgICAgIH0KICAgIH0KCn0KaW50IG1haW4oKQp7CiAgICBpbnQgbixpOwogICAgY2luPj5uOwogICAgc2VpdmUoKTsKICAgIGZvcihpPTA7cHJpbWVbaV08bjtpKyspCiAgICAgICAgY291dDw8cHJpbWVbaV08PGVuZGw7Cn0K