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:
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
import math
def is_prime(n):
	if n==2:
		return True
	if n%2==0 or n<=1:
		return False
	sqr=int(math.sqrt(n))+1
	for d in range(3,sqr,2):
		if n%d==0:
			return False
	return True
x=input()
m=[]
for i in range(2,x+1):
	if is_prime(i)==False:
		m.append(i)
print ' '.join(str(x) for x in m)