First N Primes

Given an integer \(n\), your task is to generate the first \(n\) prime numbers.

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The sequence starts from 2.

If \(n = 0\), you should output an empty result.

inputFormat

The input is provided via standard input (stdin) as a single integer \(n\) indicating the number of prime numbers to generate. \(n\) can be zero or any positive integer.

outputFormat

Output the first \(n\) prime numbers to standard output (stdout), separated by a single space. If \(n = 0\), output nothing.

1

2