Sieve of Eratosthenes: Find All Primes Less Than N

Given an integer ( n ), the task is to generate all prime numbers strictly less than ( n ) using the Sieve of Eratosthenes algorithm. The Sieve of Eratosthenes is an efficient method to identify primes, and your solution should output these primes in ascending order separated by a single space.

For example, if ( n = 10 ), the primes less than 10 are: 2, 3, 5, and 7.

inputFormat

Input is given from standard input. It consists of a single integer ( n ) (where ( 0 \le n \le 10^6 )).

outputFormat

Output all prime numbers less than ( n ) in ascending order, separated by a single space. If there are no prime numbers, output an empty line.## sample

10

2 3 5 7