Fibonacci Number Computation

Given a non-negative integer n, compute the \(n\)th Fibonacci number. The Fibonacci sequence is defined as follows:

\[ F_0 = 0, \quad F_1 = 1, \quad \text{and} \quad F_n = F_{n-1}+F_{n-2} \quad \text{for } n \ge 2. \]

Your task is to implement a program that reads an integer from standard input and outputs the corresponding Fibonacci number to standard output.

inputFormat

The input consists of a single line containing one integer \(n\) (where \(0 \le n \le 10^5\) or a practical limit based on language constraints) representing the index of the Fibonacci sequence.

outputFormat

Output a single integer which is the \(n\)th Fibonacci number.

0

0