def fibonacci(n):
if n <= 1:
return n
else:
return fibonacci(n-1) + fibonacci(n-2)
You can use this function to get the nth Fibonacci number by calling fibonacci(n). However, keep in mind that this recursive approach has exponential time complexity. For large values of n, it will be slow. There are more efficient ways to compute Fibonacci numbers, such as using iterative methods or memoization.

If you'd like more information or improvements to the code, please let me know!