mit 6.0001 - recursion - compute the nth term of the Fibonacci series

fibo.py

def fibo(n):
  '''return element 'i' of the Fibonacci series (its initial element is element '1')'''
  if n == 0 or n == 1:
    return 1
  elif n > 1:
    return fibo(n-2) + fibo(n-1)

if __name__ == "__main__":
  i = int(input('Which element to compute in the Fibonacci sequence?: '))
  print(f'Element {i} in the Fibonacci sequence: {fibo(i-1)}')