Fibonacci Number Computation

Given a non-negative integer \(n\), compute the \(n\)-th Fibonacci number defined by the recurrence:

\[ F(n)=\begin{cases} 0, & n=0\\ 1, & n=1\\ F(n-1)+F(n-2), & n\ge 2 \end{cases} \]

If the input is invalid (e.g. a negative number or a non-integer), output Error.

You should read from standard input and write the result to standard output.

inputFormat

The input consists of a single line containing one value representing the non-negative integer \(n\). Note that the input may be invalid; in that case your program should output Error.

outputFormat

If the input is valid, output the \(n\)-th Fibonacci number. Otherwise, output Error.

0

0