input: Write a function to generate Fibonacci numbers recursively in Python. The function should take an integer `n` as input and return the nth Fibonacci number. For example, the 1st and 2nd Fibonacci numbers are both 1.
  
  def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)
  
  assert fibonacci(1) == 1
  assert fibonacci(2) == 1
  assert fibonacci(3) == 2
  assert fibonacci(4) == 3
  assert fibonacci(5) == 5
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)