#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fr(i,n) for(int i=0;i<n;i++)
#define fro(i,j,n) for(int i=j;i<n;i++)
#define ifr(i,n) for(int i=n-1;i>=0;i--)

int main() {
    int n;
	cin >> n;
    int ans[n];
    fr(i,n){
      ans[i]=1;
    }
    if(n>=15){
    int count=1;
    fr(i,n*8/15){
      ans[i]*=6;
      ans[i]*=count;
      count++;
      if(count%5==0)count++;
    }
    count=1;
    fro(i,n*8/15,n*4/5){
      ans[i]*=10;
      ans[i]*=count;
      count++;
      if(count%3==0)count++;
    }
    count=1;
    fro(i,n*4/5,n*14/15){
      ans[i]*=15;
      ans[i]*=count;
      count++;
      if(count%2==0)count++;
    }
    count=1;
    fro(i,n*14/15,n){
      ans[i]*=30;
      ans[i]*=count;
      count++;
    }
    }else{
    int count=1;
    fr(i,n/3){
      ans[i]*=6;
      ans[i]*=count;
      count++;
      if(count%5==0)count++;
    }
    count=1;
    fro(i,n/3,n*2/3){
      ans[i]*=10;
      ans[i]*=count;
      count++;
      if(count%3==0)count++;
    }
    count=1;
    fro(i,n*2/3,n){
      ans[i]*=15;
      ans[i]*=count;
      count++;
      if(count%2==0)count++;
    }
    }
    fr(i,n){
      cout << ans[i] << " ";
    }
}
#include<bits/stdc++.h>
using namespace std;
int main(){
  int n;
  cin>>n;
  set<int> a;
  a.insert(6);
  a.insert(10);
  a.insert(15);
  for(int i=3;i<=1666;i++) a.insert(6*i);
  for(int i=2;i<=1000;i++) a.insert(10*i);
  for(int i=2;i<=666;i++) a.insert(15*i);
  vector<int> t(a.begin(),a.end());
  for(int i=0;i<n;i++){
    cout<<t[i]<<" ";
  }
}