Nth Fibonacci Number Recursively
Compute the Nth Fibonacci number, the textbook recursion.
Input format
A single line with one integer N (0 <= N <= 30). F(0) = 0 and F(1) = 1.
Output format
Print the Nth Fibonacci number.
Constraints
- Values fit in a 64-bit signed integer
- Trailing whitespace and a trailing newline are ignored by the judge
Read from stdin, write to stdout. Sample cases below show the exact format.
Sample cases
Example 1
Input
0Expected output
0Example 2
Input
1Expected output
1