from math import *

def Sieve(n):
    lst = [True] * (n + 1)
    S = set()
    for i in range(2, ceil(sqrt(n)) + 1):
        if lst[i]:
            for j in range(2 * i, n + 1, i):
                lst[j] = False
    for i in range(2, n + 1):
        if lst[i]:
            S.add(i)
    return sorted(list(S))

N = int(input())
S = []
for i in Sieve(5000):
    S.append(i * i)
    
L = []
for i in range(N + 1):
    L.append([i, i])
    
for s in S:
    now = s
    while now <= N + 1:
        for i in range(now, N + 1, now):
            L[i][0] //= s
        now *= s
        
from collections import *
ans = list(range(N + 1))
D = [deque() for i in range(N + 1)]
for i in range(N + 1):
    D[L[i][0]].append(L[i][1])
    
for i in range(1, N + 1):
    while len(D[i]) >= 2:
        a = D[i].popleft()
        b = D[i].pop()
        ans[a], ans[b] = ans[b], ans[a]
        
print(*ans[1:])