Fibonacci Number Calculator

Given a non-negative integer n, compute the nth Fibonacci number using a bottom-up dynamic programming approach. The Fibonacci sequence is defined as follows:

\( F(0) = 0, \quad F(1) = 1 \)

For all integers \( n \geq 2 \), the recurrence is given by:

\( F(n) = F(n-1) + F(n-2) \)

Compute and output the value of \( F(n) \) for the given input n.

inputFormat

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

outputFormat

Output the nth Fibonacci number to standard output.

0

0