Prime Numbers Less Than N

Given an integer n, output all the prime numbers that are less than n.

A number p is a prime if it is greater than 1 and has no positive divisors other than 1 and p. In this problem, you are required to print the prime numbers in increasing order, separated by a single space. If there are no prime numbers less than n, output an empty line.

Note: A number num is determined to be prime if it is not divisible by any integer from 2 to \(\lfloor \sqrt{num} \rfloor\).

inputFormat

The input consists of a single integer n provided via standard input.

Constraints:

• \( 1 \leq n \leq 10^6 \)

outputFormat

Output all prime numbers that are less than n in a single line. The primes should be separated by a single space. If there are no such primes, output an empty line.

10

2 3 5 7