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

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'
import math
def findprime(n):
	for i in range(2,int(math.sqrt(n)) + 1):
		if(n % i == 0):
			print n,
			break
n = int(raw_input())
if(n == 1 or n==2 or n==3):
	print(0)
else:
	for i in range(4,n+1):
		findprime(i)