n = int(input())
div = [i for i in range(n + 1)]
for i in range(2, n + 1):
    if div[i] != i:
        continue
    for j in range(i * 2, n + 1, i):
        div[j] = min(div[j], i)

pp = [0] * (n + 1)
lst = [[] for _ in range(n + 1)]
for i in range(1, n + 1):
    b = 0
    x = i
    y = 1
    while x > 1:
        d = div[x]
        if d == b:
            y *= d * d
            b = 0
        else:
            b = d
        x //= d

    pp[i] = i // y
    lst[pp[i]].append(i)

ans = [0] * n
for i in range(1, n + 1):
    ans[i - 1] = lst[pp[i]].pop()

print(*ans)