Fibonacci Sequence Generator

This problem requires you to generate the first n numbers of the Fibonacci sequence. You are provided with a single integer n as input, and your program should output the first n numbers in the Fibonacci series. The Fibonacci sequence is defined recursively by \(F_0 = 0\), \(F_1 = 1\) and \(F_k = F_{k-1} + F_{k-2}\) for \(k \ge 2\).

For example, if n is 5, the output should be: 0 1 1 2 3.

inputFormat

The input comes from stdin and consists of a single integer n where \(n \ge 0\).

outputFormat

Output the first n Fibonacci numbers separated by a single space to stdout. If n is 0, output nothing.

0