Recursive Fibonacci Number Computation

In this problem, you are required to compute the nth Fibonacci number using a recursive approach.

The Fibonacci sequence is defined as follows:

\(F(0) = 0\), \(F(1) = 1\), and for \(n > 1\): \(F(n) = F(n-1) + F(n-2)\).

Given an integer \(n\), calculate \(F(n)\). If \(n\) is less than or equal to 0, the result should be 0.

inputFormat

The input consists of a single line containing one integer \(n\), which represents the position in the Fibonacci sequence.

Note: The input will be provided via the standard input (stdin).

outputFormat

Output a single integer, the nth Fibonacci number, to the standard output (stdout).

0

0