Recursive Fibonacci

📝 Description

Find nth Fibonacci number using recursion (F(n) = F(n-1) + F(n-2))

Input Format

A single integer n

Output Format

F(n)

Constraints

0 ≤ n ≤ 20

🔍 Sample Input

6
            

✅ Sample Output

8