def is_prime(N):
    if N <= 1:
        return False  # 处理所有非正整数
    if N == 2 or N == 3 or N == 5:
        return True
    if N % 2 == 0 or N % 3 == 0 or N % 5 == 0:
        return False
    i = 7
    step = 4
    finish_number = int(N ** 0.5) + 1
    while i <= finish_number:
        if N % i == 0:
            return False
        i += step
        step = 6 - step
    return True

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