#include <bits/stdc++.h>
using namespace std;
int a[3000] = {0}, i = 0, j, perenos;
void mul(int n) {
  perenos = 0;
  for (j = 0; j <= i; j++) {
    a[j] = a[j] * n + perenos;
    perenos = a[j] / 10;
    a[j] %= 10;
  }
  while (perenos > 0) {
    i++;
    a[i] = perenos % 10;
    perenos /= 10;
  }
}
void print() {
  for (j = i; j >= 0; j--) cout << a[j];
}
void null() {
  for (j = 0; j < 200; j++) a[j] = 0;
}
int main() {
  int n, prime[52], p = 0, u = 3, s, k, ii;
  bool t;
  cin >> n;
  k = n;
  if (n == 2) {
    cout << "-1";
    return 0;
  }
  prime[0] = 2;
  while (p <= 50) {
    s = 0;
    t = true;
    while (prime[s] * prime[s] <= u) {
      if (u % prime[s] == 0) {
        t = false;
        break;
      }
      s++;
    }
    if (t) {
      p++;
      prime[p] = u;
    }
    u++;
  }
  ii = n - 1;
  while (ii >= 0) {
    a[0] = 1;
    k = n - 1;
    while (k >= 0) {
      if (k != ii) mul(prime[k]);
      k--;
    }
    print();
    cout << endl;
    null();
    ii--;
  }
  return 0;
}
