Fibonacci Sequence Generator

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

inputFormat

The input consists of a single integer n read from standard input.

outputFormat

Output the first n Fibonacci numbers separated by a space on a single line. If n is less than or equal to 0, output an empty line.

0