#C778. Fibonacci Sequence

    ID: 51688 Type: Default 1000ms 256MiB

Fibonacci Sequence

Fibonacci Sequence

Given a non-negative integer N, compute the Nth Fibonacci number. The Fibonacci sequence is defined as follows:

\(F(0)=0\), \(F(1)=1\), and for \(n \ge 2\), \(F(n) = F(n-1) + F(n-2)\).

Your program should read the integer from standard input and output the corresponding Fibonacci number to standard output.

inputFormat

The input consists of a single line containing a non-negative integer N.

outputFormat

Output the Nth Fibonacci number computed according to the definition above.

## sample
0
0