#C14353. Primes Less Than N

    ID: 43993 Type: Default 1000ms 256MiB

Primes Less Than N

Primes Less Than N

Given a non-negative integer n, your task is to output all prime numbers less than n. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The answer should list all the prime numbers in ascending order, separated by a single space.

If there are no prime numbers less than n, output an empty line.

inputFormat

The input consists of a single line containing one integer n (0 ≤ n ≤ 106).

outputFormat

Output all the prime numbers less than n in ascending order on a single line, separated by a single space. If there are no such primes, output an empty line.

## sample
10
2 3 5 7