Fibonacci Number

Given a non-negative integer \(n\), compute the \(n\)th Fibonacci number. The Fibonacci sequence is defined by the recurrence relation \(F(0)=0\), \(F(1)=1\) and for \(n \ge 2\), \(F(n)=F(n-1)+F(n-2)\). This classic problem tests your understanding of iterative algorithms and recursion.

inputFormat

The input consists of a single integer \(n\) provided via standard input.

outputFormat

Output the \(n\)th Fibonacci number to standard output.

0

0