def is_prime(N):
    if N <= 1:return False
    finish_number = int(N ** 0.5) + 1

    for i in range(2, finish_number):
        if N % i == 0:
            return False
    return True

#列出1-N之间所有质数
N = int(input())
print([n for n in range(1,N+1) if is_prime(n)])