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:
import math
prime = [0] * 10001
for i in range(2, int(math.sqrt(10001))+1):
	if prime[i] == 0:
		for j in range(2*i, 10001, i):
			prime[j] = 1
for i in range(4, int(raw_input())+1):
	if prime[i] == 1:
		print i,