def kaideng(N):
    lights = [False] * N
    for i in range(1,N+1):
        I = i%3
        if I ==0:
            #遍历i的倍数
            for j in range(i,N,i):
                #索引减一，因为索引是从0开始
                lights[j-1] = not lights[j-1]
        elif I ==1:
            for j in range(i,N,i):
                lights[j-1] = True
        elif I==2:
            for j in range(i,N,i):
                lights[j-1] = False
    #i+1为灯的编号，if灯为True
    on_lights = [i+1 for i,light in enumerate(lights) if light]
    return on_lights

N = int(input())
result = kaideng(N)
# *是解包
print(*result)