#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:32000000")
using namespace std;
const double pi = 3.1415926535897932384626433832795;
template <class T>
inline T Sqr(const T &x) {
  return x * x;
}
template <class T>
inline T Abs(const T &x) {
  return x >= 0 ? x : -x;
}
int n;
int p[1000];
int k;
int res[55];
bool isPrime(int x) {
  if (x < 2) return false;
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0) return false;
  return true;
}
void solve() {
  for (int i = 2; i < 1000; i++)
    if (isPrime(i)) p[k++] = i;
  scanf("%d", &n);
  if (n == 2) {
    printf("-1");
    return;
  }
  for (int i = 0; i < (n); i++) res[i] = 1;
  for (int i = 0; i + 1 < n; i++) res[i] *= 2;
  for (int i = 1; i < n; i++) res[i] *= 3;
  res[0] *= 5;
  res[n - 1] *= 5;
  for (int i = 1; i + 1 < n; i++) res[i] *= p[i + 3];
  for (int i = 0; i < (n); i++) printf("%d\n", res[i]);
}
int main() {
  solve();
  return 0;
}
