Fibonacci Sequence Recursion

The task is to compute the n-th Fibonacci number using a recursive algorithm. The Fibonacci sequence is defined as follows:

\( F_0 = 0, \; F_1 = 1 \)

and for \( n \ge 2 \), \( F_n = F_{n-1} + F_{n-2} \).

Your program should read an integer n from standard input and output the value of \( F_n \) to standard output. Ensure that your solution works correctly for the provided test cases.

inputFormat

The input consists of a single integer n (0 ≤ n ≤ 30) read from standard input.

outputFormat

Output the n-th Fibonacci number to standard output.

0

0