#include <bits/stdc++.h>
using namespace std;
bool prime[1000010];
vector<int> primes;
void Sieve(int n) {
  prime[0] = prime[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (!prime[i]) {
      for (int j = i * i; j < n; j += i) {
        prime[j] = 1;
      }
    }
  }
  for (int i = 2; i < n; i++) {
    if (!prime[i]) primes.push_back(i);
  }
}
int main() {
  int n;
  cin >> n;
  if (n == 2) {
    cout << "-1" << endl;
    return 0;
  }
  for (int i = 1; i < n - 1; i++) {
    cout << i * 14 << endl;
  }
  cout << 10 << endl << 35 << endl;
  return 0;
}
