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 sieveof(a, b):
        ##a and b are the range between which the primes are to be found
        ##a and b are inclusive
        s=[]
        for i in range(b+1):
                s.append(i)
        s[0]=2
        s[1]=2
        for i in range(2,1+int(b**0.5)):
                j=2
                while i*j<=b:
                        s[i*j]=None
                        j+=1
        for i in range(a, b+1):
                if s[i]==None:
                        print i,
a=0
b=input()
sieveof(a, b)