Fibonacci Sequence Generator

Given a positive integer n, your task is to generate the first n terms of the Fibonacci sequence. The Fibonacci sequence is defined as follows:

\(F(0)=0, F(1)=1,\) and for \(n \ge 2\), \(F(n)=F(n-1)+F(n-2)\).

If the given input n is less than or equal to 0, the program should output nothing.

The output must be the sequence of Fibonacci numbers, separated by a single space, printed in one line.

inputFormat

The input consists of a single integer n (\(n\) can be any integer).

outputFormat

If \(n > 0\), output the first n Fibonacci numbers separated by spaces in one line. If \(n \le 0\), output nothing.

5

0 1 1 2 3