Problem: In this problem you will be given a range 'n', and you are supposed to find all composite numbers within that range. Make your program efficient as time limit of the program is set to 1 second. Choose an efficient algorithm to find all the composite numbers within the range 0 to n.

Input

n - a single positive Integer.

Output

Space separated composite-numbers within the range of 0 and n.

Constrains

1 ≤ n ≤ 10000

SAMPLE INPUT
8

SAMPLE OUTPUT
4 6 8

Solution (in PYTHON):

Solution:
def get_primes(n):
    numbers = set(range(n, 1, -1))
    primes = [1]
    while numbers:
        p = numbers.pop()
        primes.append(p)
        numbers.difference_update(set(range(p*2, n+1, p)))
    return primes
a=get_primes(10000)
n=input()
b=[]
for i in range(1,n+1):
    if i not in a:
        b.append(i)
print ' '.join(map(str,b))