import strutils, sequtils, algorithm

func isPrime(n: int): bool =
    if n < 2:
        return false
    var i = 2
    while i * i <= n:
        if n mod i == 0:
            return false
        inc(i)
    return true

func nextPrime(n: int): int =
    var i = n + 1
    while not isPrime(i):
        inc(i)
    return i

let n = stdin.readLine.parseInt

var result = newSeqWith(n, 1)

var k = 1
for i in 0 ..< n-1:
    k = nextPrime(k)
    result[i] *= k
    result[i+1] *= k

result.reverse

for i in 0 ..< n-1:
    let ratio = result[i] div result[i + 1] + 1
    result[i + 1] *= nextPrime(ratio.max(100))

echo result.join(" ")