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:
limit = 10000


def primes_sieve2(limit):
    a = [True] * limit
    a[0] = a[1] = False
    for (i, isprime) in enumerate(a):
        if isprime:
            for n in xrange(i*i, limit, i):
                a[n] = False
    return a

if __name__ == "__main__":
    a = primes_sieve2(limit)
    n = input()
    for i in xrange(2, n+1):
        if not a[i]:
            print i,