Fibonacci Sequence Generation

Given an integer n, generate the first n numbers of the Fibonacci sequence.

The Fibonacci sequence is defined as follows:

\(F_0 = 0,\; F_1 = 1\), and for every \(n \geq 2\), \(F_n = F_{n-1} + F_{n-2}\).

If n is less than or equal to 0, the output should be empty.

The answer should be printed in one line with each number separated by a single space.

inputFormat

The input consists of a single line containing an integer n (n may be negative, zero, or positive).

outputFormat

Output a single line containing the first n Fibonacci numbers separated by a single space. If n is less than or equal to 0, output an empty line.

5

0 1 1 2 3