Fibonacci Number

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

• \(F(0)=0\)
• \(F(1)=1\)
• \(F(n)=F(n-1)+F(n-2)\) for \(n>1\)

You may assume that \(0 \le n \le 90\) to avoid issues with integer overflow in some languages.

inputFormat

A single non-negative integer (n) is provided as input via standard input (stdin).

outputFormat

Output a single integer, which is the (n)th Fibonacci number, to standard output (stdout).## sample

0

0