Given a number n, print n-th Fibonacci Number
using recursion:

Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, ...

Contraints:
1 <= n <= 10^6
Time Limit: 1 sec

Example:
Input:
n = 5

Output:
Fibonacci(5) = 5

Input:
n = 10

Output:
Fibonacci(10) = 55

// Hint:
// Write a recursive
An immortal couple have been seen throughout recorded history, write an account of them in any time period you wish. Bonus points if you match the writing style of the time period.

In the waning days of the late fifteenth century, a curious tale unfurled in the quaint and mystical lands of Tuscany. It was a tale so peculiar, so beguiling, that even the most fervent devotees of the arcane could scarcely fathom the truths it concealed.

Deep amidst the verdant and secluded valley of the Arno, at the heart of the hallowed and resplendent Medici court, an enigmatic couple resided. Their names, whispered with a mixture of awe and trepidation,