Fibonacci Number

The Fibonacci sequence starts 0, 1 and each next number is the sum of the previous two: 0, 1, 1, 2, 3, 5, 8, …. F(0) = 0 and F(1) = 1.

Implement fibonacci(n).

Input

n: The position in the sequence.

Output

Return F(n).

Vincoli

0 ≤ n ≤ 90

Esempi

Input:
n = 10

Output atteso:
expected = 55

Input:
long long n = 10;

Output atteso:
long long expected = 55;

Input:
long n = 10;

Output atteso:
long expected = 55;

Input:
n = 0

Output atteso:
expected = 0

Input:
long long n = 0;

Output atteso:
long long expected = 0;

Input:
long n = 0;

Output atteso:
long expected = 0;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• GWU CS1111 Introduction to Software Development - lab sequence