input: def fibonacci(n):
      """
      A recursive function to generate Fibonacci numbers. The function returns the nth Fibonacci number.
      The Fibonacci sequence is defined as follows: The first and second elements of the sequence are 1, 
      and each subsequent element is the sum of the previous two elements.
      
      >>> fibonacci(1)
      1
      >>> fibonacci(2)
      1
      >>> fibonacci(10)
      55
      """
      if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)
output:     if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n - 1) + fibonacci(n - 2)