Fibonacci Sequence: Write a recursive function to calculate the nth Fibonacci number upon the user's input. Prompt the user to enter a sequence number greater than $1.$ The task entails crafting a recursive function named "Fibonacci $($n$)"$ to determine the nth Fibonacci number. This function follows the logic that Fibonacci $($n$)$ equals Fibonacci $($n$-1)$ plus Fibonacci $($n$-2)$ for n greater than $1,$ with initial conditions Fibonacci $(0)$ equals $0$ and Fibonacci $(1)$ equals $1.$ For instance, if we compute Fibonacci $(8),$ the result is $21,$ as the first eight Fibonacci numbers are $1,1,2,3,5,8,13,$ and $21.$ Each subsequent term is the sum of the two preceding terms, such that in the case of Fibonacci $(8),$ it's $8+13=21,$ representing the eighth term in the sequence.