#include <bits/stdc++.h>
using namespace std;
int p[10000], Pn, sq;
void Set_Prime_Array() {
  p[0] = 2, Pn = 1;
  for (int i = 3; i <= 10000; i += 2) {
    sq = (int)sqrt(i);
    for (int j = 0; j < Pn; j++)
      if (p[j] > sq) {
        p[Pn++] = i;
        break;
      } else if (i % p[j] == 0)
        break;
  }
}
int main() {
  Set_Prime_Array();
  int n, use[3] = {6, 15, 10};
  while (scanf("%d", &n) == 1) {
    if (n == 2)
      puts("-1");
    else {
      for (int i = 0; i < n; i++) printf("%d\n", use[i % 3] * p[3 + i]);
    }
  }
  return 0;
}
