Fibonacci Sequence Generator

Given an integer n, output the first n numbers of the Fibonacci sequence. The Fibonacci sequence is defined by the recurrence relation \( F_n = F_{n-1} + F_{n-2} \), where \( F_0 = 0 \) and \( F_1 = 1 \). If n is less than or equal to 0, output nothing.

Your program should read the input from standard input and print the results to standard output. The sequence numbers should be printed space-separated in one line.

inputFormat

The input consists of a single integer n which represents how many Fibonacci numbers should be generated.

Example: 5

outputFormat

The output should contain the first n Fibonacci numbers, printed in one line and separated by a single space.

Example Output for input 5: 0 1 1 2 3

1

0