const n = +require("fs").readFileSync("/dev/stdin", "utf8");

const primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89].reverse();
const mul = [1, 1, 2, 3, 4, 5, 6, 7, 9, 13, 17, 20, 27, 37, 49, 67, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1];
const gcd = (a, b) => {
  if (!b) return a;
  return gcd(b, a % b);
}

const result = [primes[0]];
for (let i = 1; i < 25; i++) {
  let next = primes[i - 1];
  if (i < primes.length) {
    next *= primes[i];
  }
  for (let j = 1; ; j++) {
    if (gcd(j, result[i - 1]) === 1 && next * j > result[i - 1]) {
      next *= j;
      break;
    }
  }
  result.push(next);
}
console.log(result.slice(0, n).join(' '));