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:
a=[0]*10001
for i in xrange(4,10001,2):
	a[i]=1
for i in xrange(3,10001,2):
	j=i
	while j*i<10001:
		a[i*j]=1
		j+=1


n=input()
for i in xrange(2,n+1):
	if a[i]==1:
		print i,