/* -*- coding: utf-8 -*-
 *
 * 3159.cc:  No.3159 Just Answer 10 Integers! - yukicoder
 */

#include<cstdio>
#include<cassert>
#include<algorithm>
#include<numeric>

using namespace std;

/* constant */

const int MAX_N = 10;
const int M = 9;
const int ps[M] = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };

/* typedef */

/* global variables */

int as[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  int pm = 1;
  for (int i = 0; i < M; i++) pm *= ps[i];
  
  for (int i = 0; i < M; i++) as[i] = pm / ps[i];
  as[M] = pm;
  
  for (int i = 0; i < n; i++)
    printf("%d%c", as[i], (i + 1 < n) ? ' ' : '\n');
  
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++)
      assert(lcm(as[i], as[j]) == pm);
  
  return 0;
}