#include <bits/stdc++.h>
using namespace std;


int main() {
  int N;
  cin >> N;//2,3,5,7,11//6,10
  //6,10,15,
  int A[N];
  A[0]=6;A[1]=10;A[2]=15;
  int j=-1;
  for (int i=3; i<N; i++) {
      A[i]=6*(i-1);
      if (A[i]>10000) {
          j=i;break;
      }
  }
  int jj=-1;
  if (j>0) {
      int k=2;
      for (int i=j; i<N; i++) {
          if (k%3==0) k++;
          A[i]=10*k;
          k++;
          if (A[i]>10000) {
              jj=i;break;
          }
      }
  }
  if (jj>0) {
      int k=2;
      for (int i=jj; i<N; i++) {
          if (k%2==0) k++;
          A[i]=15*k;
          k++;
      }
  }
  for (int i=0; i<N; i++) {
      cout << A[i] << " ";
  }
  cout << endl;
}
//红太阳zhouakngyang txdy!
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#define Macesuted cout<<"kawaii"<<endl
#define MatrixCascade cout<<"npsl"<<endl
#define Karry5307 cout<<"nmsl"<<endl
using namespace std;
#define int long long
inline int read()
{
	int sum=0,nega=1;char ch=getchar();
	while(ch>'9'||ch<'0'){if(ch=='-')nega=-1;ch=getchar();}
	while(ch<='9'&&ch>='0')sum=sum*10+ch-'0',ch=getchar();
	return sum*nega;
}
const int N=1e5+9,M=1e4;
int vis[N],n;
signed main()
{
	for(int i=6;i<=M;i+=6)vis[i]=1;
	for(int i=10;i<=M;i+=10)vis[i]=1;
	for(int i=14;i<=M;i+=14)vis[i]=1;
	n=read();cout<<105<<" ";n--;
	int now=1;
	while(n!=0)
	{
		if(vis[now])
		{
			printf("%d ",now);n--;
		}
		now++;
	}
	return 0;
}

