Iterative Fibonacci Sequence

Given a non-negative integer n, compute the n-th Fibonacci number using an iterative approach. The Fibonacci sequence is defined as:

\(F(0)=0,\ F(1)=1,\) and for \(n \ge 2\), \(F(n)=F(n-1)+F(n-2)\).

Your task is to implement the iterative algorithm without using recursion or built-in functions for Fibonacci computation.

inputFormat

The input is provided via standard input (stdin) and consists of a single non-negative integer n (with \(0 \le n \le 50\)).

outputFormat

Output the n-th Fibonacci number to standard output (stdout). Make sure there are no extra spaces or newline characters in the output.

0

0