Fibonacci Sequence Generator

Given an integer n, your task is to compute the first n terms of the Fibonacci sequence defined as follows:

$$F_0=0, \quad F_1=1, \quad \text{and} \quad F_n = F_{n-1}+F_{n-2}\ \text{for } n \ge 2.$$

If n is less than or equal to zero, the output should be empty. Otherwise, output the sequence on a single line with numbers separated by a single space.

inputFormat

The input consists of a single integer n read from stdin indicating the number of terms in the Fibonacci sequence to generate.

outputFormat

Output the first n Fibonacci numbers separated by spaces on a single line to stdout. If n is less than or equal to zero, output nothing.

5

0 1 1 2 3