**By: Saurav**

**2017-12-27 02:33:00 UTC**

For this question, you will write a program that generates values from the Fibonacci sequence. The Fibonnaci sequence is recursively defined by:

Fn = Fn - 1 + Fn - 2

Using the following seed values:

F0 = 0, F1 = 1

Given a number n, print the nth value of the Fibonacci sequence.

Examples

Input:

12

Output:

144

Input:

30

Output:

832040

The question itself gives the tests we can use.

Without wasting much effort on the bad algorithm, I will jump ahead to using memoization with Hash.

Let's Clean it a little bit.

Owned & Maintained by Saurav Prakash

If you like what you see, you can help me cover server costs or buy me a cup of coffee though donation :)