Fibonacci Sequence Generation

Given a non-negative integer N, output the first N numbers in 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}\).

If N is less than or equal to zero, output nothing (i.e. an empty line).

inputFormat

The input consists of a single integer N provided via standard input.

outputFormat

Output the first N Fibonacci numbers in order, separated by a single space. There should be no extra spaces at the beginning or end. If N is less than or equal to 0, output an empty line.

## sample

1

0

</p>