N = int(input())
def seachPrimeNum(N):
    if N == 2:
        return []
    max = int(N**0.5)
    seachList = [i for i in range(2,N+1)]
    primeNum = []
    while seachList[0] <= max:
        primeNum.append(seachList[0])
        tmp = seachList[0]
        seachList = [i for i in seachList if i % tmp != 0]
    primeNum.extend(seachList)
    return primeNum

N2 = -(-N//2)
PL = seachPrimeNum(10**5)
X = [2**i for i in range(1,12)]
ans = []
for i in range(N2):
    ans.append(X[i%11]*PL[i//11])
print(*ans)