#include <bits/stdc++.h>
using namespace std;
const int PRIMEMAX = 1000000;
bool GetedPrime = false;
char Prime[PRIMEMAX];
void EratosthenesSieve() {
  if (GetedPrime == true) return;
  int NeedCount = (int)sqrt(PRIMEMAX) + 1;
  Prime[0] = 1;
  Prime[1] = 1;
  Prime[2] = 0;
  for (int i = 2; i < NeedCount; i++) {
    if (Prime[i] == 0) {
      for (int j = i * 2; j < PRIMEMAX; j += i) Prime[j] = 1;
    }
  }
  GetedPrime = true;
}
vector<int> PrimeList;
int getPrimeList() {
  PrimeList.clear();
  int c = 0;
  EratosthenesSieve();
  for (int i = 2; i < PRIMEMAX; i++) {
    if (Prime[i] == 0) {
      PrimeList.push_back(i);
      c++;
    }
  }
  return c;
}
int main(int argc, char *argv[]) {
  int n;
  getPrimeList();
  for (; cin >> n;) {
    if (n == 2) {
      cout << "-1" << endl;
      continue;
    }
    for (int i = 0; i < 3; i++) {
      unsigned long long res = 1;
      for (int j = 0; j < 3; j++) {
        if (i == j) continue;
        res = res * (long long)PrimeList[j];
      }
      cout << res << endl;
    }
    unsigned long long t = 1;
    for (int i = 0; i < 3; i++) t *= PrimeList[i];
    for (int i = 3; i < n; i++) {
      cout << t * (i - 2) << endl;
    }
  }
  return 0;
}
