input: def fibonacci(n: int) -> int:
      """Generate the nth Fibonacci number using a recursive approach.
      The Fibonacci sequence is defined as:
      F(1) = 1
      F(2) = 1
      F(n) = F(n-1) + F(n-2) for n > 2
      >>> fibonacci(1)
      1
      >>> fibonacci(2)
      1
      >>> fibonacci(10)
      55
      """
output:     if n == 1 or n == 2:
          return 1
      return fibonacci(n-1) + fibonacci(n-2)