Fibonacci Sequence Generator

Given an integer \(n\), generate the first \(n\) terms of the Fibonacci sequence. The Fibonacci sequence is defined by the recurrence relation \(F(n) = F(n-1) + F(n-2)\) with initial values \(F(0)=0\) and \(F(1)=1\). Output the sequence as a comma-separated string.

inputFormat

A single integer \(n\) (\(1 \le n \le 10^3\)) is provided from standard input.

outputFormat

Output a single line containing the first \(n\) Fibonacci numbers separated by a comma and a space.

1

0