## https://yukicoder.me/problems/no/2449

from collections import deque

def main():
    N = int(input())

    # osa-k法による素因数分解
    primes = [i for i in range(N + 1)]
    for p in range(2, N + 1):
        if p != primes[p]:
            continue

        x = 2 * p
        while x <= N:
            if primes[x] > p:
                primes[x] = p
            x += p
        
    x_map = {1:[1]}
    x_array = [1]
    for p in range(2, N + 1):
        p0 = p
        primes_ = {}
        while p > 1:
            q = primes[p]
            if q not in primes_:
                primes_[q] = 0
            primes_[q] += 1
            p //= q
        
        r = 1
        for q, v in primes_.items():
            if v % 2 == 1:
                r *= q
        if r not in x_map:
            x_map[r] = []
        x_map[r].append(p0)
        x_array.append(r)

    r_map2 = {}    
    for r, r_array in x_map.items():
        r_array.sort(reverse=True)
        queue = deque(r_array)
        r_map2[r] = queue

    answer= []
    for r in x_array:
        answer.append(r_map2[r].popleft())
    
    print(" ".join(map(str, answer)))

    


if __name__ == "__main__":
    main()