Fibonacci Sequence Generator

Given a positive 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 (n \geq 2), (F(n)=F(n-1)+F(n-2)).

For example, if (n = 5), then the sequence is: 0, 1, 1, 2, 3.

inputFormat

A single line containing an integer (n) (where (n \geq 0)).

outputFormat

Print the first (n) Fibonacci numbers separated by a single space. If (n = 0), print nothing.## sample

5

0 1 1 2 3