#C7607. Fibonacci Sequence

    ID: 51497 Type: Default 1000ms 256MiB

Fibonacci Sequence

Fibonacci Sequence

Given an 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\).

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

inputFormat

The input consists of a single integer n (\(n \geq 0\)). The value is provided via standard input.

outputFormat

Output a single integer: the n-th Fibonacci number, printed to standard output.

## sample
0
0

</p>