4. Simplified Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Let us call a natural number "simplified" if it is the product of exactly two prime numbers (not necessarily distinct). Find all simplified numbers in the range from $$$1$$$ to $$$n$$$.

Input

An integer $$$n$$$ is given as input.

Output

Output all simplified numbers in the range from $$$1$$$ to $$$n$$$ in ascending order.

Scoring

Subtask 1 (up to 40 points): ($$$1 \le n \le 1000$$$)

Subtask 2 (up to 60 points): ($$$1 \le n \le 10^5$$$)

Example
Input
8
Output
4
6