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
n=int(raw_input())
prime = [True]*(n+1)

def mark(prime,k,n):
	step=2*k
	while step<=n:
		prime[step]=False
		step+=k

for i in range(2,n+1):
	if(prime[i]==True):
		mark(prime,i,n)

for i in range(1,n+1):
	if(prime[i]==False):
		print i,