#include <bits/stdc++.h>
using namespace std;
long long a[100];
int prime[1005];
bool flag[1005];
int n;
int tot;
void findPrime() {
  tot = 0;
  for (int i = 2; i < 1000; i++)
    if (!flag[i]) {
      prime[++tot] = i;
      for (int j = 2; i * j < 1000; j++) flag[i * j] = true;
    }
}
int main() {
  findPrime();
  cin >> n;
  if (n == 2) {
    cout << -1 << endl;
    return 0;
  }
  int m = n / 2;
  for (int i = 1; i <= n; i++) a[i] = prime[i];
  long long p1 = prime[n + 1], p2 = prime[n + 2], p3 = prime[n + 3],
            p4 = prime[n + 4];
  for (int i = 1; i <= m; i++) a[i] *= p1 * p3 * p4;
  for (int i = m + 1; i < n; i++) a[i] *= p2 * p3;
  a[n] *= p4 * p2;
  for (int i = 1; i <= n; i++) cout << a[i] << endl;
  return 0;
}
