#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define M 10000002
#define N 100002
int a[M],b[N];
int count(){
int cn=0,i,j;
for(i=2;i<10000000;i++){
if(a[i]!=0)continue;
for(j=i+i;j<M;j+=i)
a[j]=1;
if(a[i]==0)
b[cn++]=i;
if(cn>N)break;
}
}
int main(){
int n,i,j;
count();
while(~scanf("%d",&n)){
for(i=0;i<n-1;i++)
printf("%d ",b[i]);
printf("%d\n",b[n-1]);
}
return 0;
}
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define M 10000002
#define N 100002
int a[M],b[N];
int count(){
int cn=0,i,j;
for(i=2;i<10000000;i++){
if(a[i]!=0)continue;
for(j=i+i;j<M;j+=i)
a[j]=1;
if(a[i]==0)
b[cn++]=i;
if(cn>N)break;
}
}
int main(){
int n,i,j;
count();
while(~scanf("%d",&n)){
for(i=0;i<n-1;i++)
printf("%d ",b[i]);
printf("%d\n",b[n-1]);
}
return 0;
}