Fibonacci Sequence

Given a non-negative integer n, your task is to compute the first n Fibonacci numbers. The Fibonacci sequence is defined as follows:

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

Output the sequence as a list of numbers separated by a single space. If n equals 0, output nothing.

inputFormat

Input is provided via standard input (stdin) as a single integer n (0 ≤ n ≤ 90).

outputFormat

Output the first n Fibonacci numbers separated by a single space. There should be no extra spaces at the beginning or end of the output. If n is 0, output nothing.## sample

0