require "prime"

N = gets.to_i
gcds = Prime.take(2 + N - 1).to_a[2..][0, N - 1].reverse
A = [1] * N
(0 ... N - 1).each do |i|
	g = gcds[i]
	A[i] *= g
	A[i + 1] *= g
end
(1 ... N).each do |i|
	p = (i % 2 == 0 ? 2 : 3)
	while A[i - 1] >= A[i]
		A[i] *= p
	end
end

puts A.join(" ")