First N Primes Generation

You are given a single integer n. Your task is to generate the first n prime numbers.

A prime number is an integer \( p > 1 \) that has no positive divisors other than 1 and \( p \). For example, if n is 5, the first 5 prime numbers are: 2, 3, 5, 7, and 11.

If n is less than or equal to 0, print nothing (i.e. an empty output).

inputFormat

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

outputFormat

Output the first n prime numbers in order, separated by a single space, using standard output (stdout). If n is less than or equal to 0, output nothing.

5

2 3 5 7 11