#include <bits/stdc++.h>
using namespace std;
int n;
int nxt = 0;
int prime[55];
int sz;
int dig[1000];
bool isprime(int x) {
  for (int i = 3; i * i <= x; i += 2)
    if (x % i == 0) return false;
  return true;
}
int main() {
  cin >> n;
  if (n == 2) {
    cout << "-1" << endl;
    return 0;
  }
  prime[nxt++] = 2;
  for (int i = 1, x = 3; i < n; ++i) {
    while (!isprime(x)) x += 2;
    prime[nxt++] = x;
    x += 2;
  }
  for (int i = 0; i < nxt; ++i) {
    sz = 0;
    dig[0] = 1;
    for (int j = 0; j < nxt; ++j)
      if (i != j) {
        int t = 0;
        for (int k = 0; k <= sz; ++k) {
          dig[k] = dig[k] * prime[j] + t;
          t = dig[k] / 10;
          dig[k] %= 10;
        }
        while (t > 0) {
          dig[++sz] = t % 10;
          t /= 10;
        }
      }
    for (int j = sz; j >= 0; --j) cout << dig[j];
    cout << endl;
  }
  return 0;
}
