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 isprime(n):
	if n%2==0: return False
	for i in xrange(3,int(n**0.5)+1,2):
		if n%i==0: return False
	return True
	
for i in xrange(4,input()+1):
	if not isprime(i): print i,