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
import math
no = int(raw_input())


def shouldPrint(n):
	shouldPrint = False
	
	if(n == 0):
		shouldPrint = False;
	if(n == 1):
		shouldPrint =  False;
	
	upperLimit = int(math.sqrt(n))
	start = 2
	
	while(start <= upperLimit):
		if(n % start == 0):
		  shouldPrint = True
		start += 1
	return shouldPrint	  

s = ""

for i in range(0, no + 1):
	if(shouldPrint(i) == True):
		s += " " + str(i)
print s