Fibonacci Memoization

Given a non-negative integer \(n\), compute the \(n\)th Fibonacci number using memoization. The Fibonacci sequence is defined by the recurrence relation: \(F(0)=0\), \(F(1)=1\), and \(F(n)=F(n-1)+F(n-2)\) for \(n \geq 2\). This problem tests your ability to optimize recursive functions using memoization techniques.

inputFormat

The input is provided via standard input (stdin) and consists of a single integer \(n\) (where \(0 \le n \le 90\)).

outputFormat

Output the \(n\)th Fibonacci number to standard output (stdout).

0

0