#primes.py

#test if a number is prime
def is_prime (num):
    import math
    if num == 1:
        return False
    if num%2 == 0 and num!=2:   #even, except for 2
        return False
    for i in range(3,int(math.sqrt(num))+1, 2):  #test each odd number up to sqrt of num
        if num%i == 0:       #if evenly divisible
            return False	#is not prime  

    return True     #no divisors found, so is prime

#**********************************

'''
n = eval(input("Enter a whole number: "))
if is_prime(n):
    print("It is prime")
else:
    if n != 1:
        print("It is composite")
    else:
        print("1 is neither prime nor composite. It is the 'unit'")
'''

max_n = int(input("Enter maximum number to search up to: "))

if max_n>2:
    print(2,end=" ")
    
for i in range(3,max_n,2):   #test every odd number from 3
    if is_prime(i):
        print(i,end=" ")
print()