input: Write a function to generate Fibonacci numbers recursively. The function should take an integer `n` as input, and return the `n`-th Fibonacci number. The Fibonacci sequence starts with 1 for both the 1st and 2nd numbers, and each subsequent number is the sum of the previous two.
  
  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
  assert fibonacci(10)==55
output: def fibonacci(n):
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)