Fibonacci Number Calculation

Given an integer \(n\), calculate the \(n\)-th Fibonacci number using an iterative approach. The Fibonacci sequence is defined as \(F(0)=0\), \(F(1)=1\), and for all \(n \ge 2\), \(F(n)=F(n-1)+F(n-2)\).

This problem tests your ability to implement a simple iterative algorithm and handle basic I/O operations.

inputFormat

The input consists of a single line containing an integer \(n\) \((0 \le n \le 90)\) read from standard input.

outputFormat

Output a single integer representing the \(n\)-th Fibonacci number to standard output.

0

0