题目描述
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
输入格式
见题面
输出格式
见题面
样例输入
8
SAMPLE
样例输出
4 6 8