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 F(n)=F(n-1)+F(n-2) \text{ for } n \ge 2\).

Your task is to implement a program that reads an integer \(n\) from the standard input and outputs \(F(n)\) to the standard output.

inputFormat

The input consists of a single line containing one integer \(n\) (where \(n \ge 0\)).

outputFormat

Output a single line containing the \(n\)th Fibonacci number.

0

0