#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define sz(c) ((ll)(c).size())
#define ALL(x) x.begin(),x.end()
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define BS(A,x) binary_search(ALL(A),x)
#define rep(i,a,b) for(int i=a;i<b;i++)
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
using vi = vector<int>; 
using vvi = vector<vi>; 
using li =vector<ll>;
using lli=vector<li>;
const long long mod=998244353;
int main(){
  int n;cin>>n;
  vi A(10);
  //2 3 5 7 11 13 17
  ll s=2*3*5*7*11*13*17*19*23;
  A[0]=s;
  A[1]=s/2;
  A[2]=s/3;
  A[3]=s/5;
  A[4]=s/7;
  A[5]=s/11;
  A[6]=s/13;
  A[7]=s/17;
  A[8]=s/19;
  A[9]=s/23;
  rep(i,0,n)cout<<A[i]<<" ";
}