Generate the First N Fibonacci Numbers

Given a positive integer (N), your task is to generate the first (N) Fibonacci numbers. The Fibonacci sequence is defined as follows: (F_0 = 0, F_1 = 1), and for all (n \geq 2), (F_n = F_{n-1} + F_{n-2}). If (N) is not positive (i.e. zero or negative), the program should output nothing (an empty sequence). Your solution should read the input from standard input and print the output to standard output with numbers separated by a single space.

inputFormat

A single line containing an integer (N), representing the number of Fibonacci numbers to generate, is provided via standard input.

outputFormat

Output the first (N) Fibonacci numbers separated by a space. If (N \leq 0), output nothing.## sample

5

0 1 1 2 3