Fibonacci Sequence Calculator

The Fibonacci sequence is one of the most famous sequences in mathematics, defined recursively as:

$f_0 = 0, \quad f_1 = 1, \quad f_n = f_{n-1} + f_{n-2} \quad \text{for} \; n \geq 2$

Your task is to compute the n-th term of the Fibonacci sequence.

For example, when n = 7, the output should be 13 because the sequence starts as 0, 1, 1, 2, 3, 5, 8, 13, ...

inputFormat

The input consists of a single integer n (0 ≤ n ≤ 90), representing the position in the Fibonacci sequence. The sequence is 0-indexed, meaning that the 0-th term is 0 and the 1-st term is 1.

outputFormat

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

0

0