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
def primes(n):
	s = [1] * n
	for i in xrange(3, int(n**.5)+1,2):
		if s[i]:
			s[i*i::2*i] = [0] *((n-i*i-1)/(2*i)+1)
	return [2] + [i for i in xrange(3,n,2) if s[i]]
n = int(raw_input())
a = set(primes(n+100))
for i in xrange(4, n+1):
	if i not in a: print i,
print