Find nth Fibonacci number recursively.

Name: InsidCode
Author: Namish Yadav

Difficulty: Hard

Phase: 3 · Recursion

XP Reward: 30 XP

Topics: Recursion, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given N (0-indexed: F(0)=0, F(1)=1), find the N-th Fibonacci number recursively. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 6

Output: 8

Explanation: Sample execution for input 6