Exercise 14: Recursion

Problem Statement

Implement a recursive function that takes a number $n$ as input, and output the $nth$ term of the Fibonacci series.

The Fibonacci sequence is $0, 1, 1, 2, 3, 5, 8, 13, 21$ where the nth term is the sum of $(n-1)th$ and $(n-2)th$ term.

The $0th$ term is $0$ and the $1st$ term is $1$. Therefore, the $2nd$ term is $0 + 1 = 1$.

Input

A testVariable that contains the $nth$ term

Output

The $nth$ term in the Fibonacci series, i.e., the element in the Fibonacci series at index testVariable

Sample Input

6

Sample Output

8

Test Yourself

Write your code in the given area. If you get stuck, you can look at the solution.