Memoized Fibonacci Number

Given a non-negative integer n, compute the n-th Fibonacci number using the memoization technique. The Fibonacci sequence is defined as follows:

$$F(0)=0,\quad F(1)=1,\quad F(n)=F(n-1)+F(n-2)\text{ for }n\geq2.$$

Your task is to implement a program that reads an integer from standard input and outputs its corresponding Fibonacci number to standard output.

inputFormat

The input consists of a single non-negative integer n provided via standard input.

outputFormat

Output the n-th Fibonacci number to standard output.

0

0